Skip to main content

Humord

Search from vocabulary

Content language

Concept information

Natural science and mathematics > Mathemathics > Symbolic logic > Computability theory > NP-complete problems
Philosophy > Logics > Symbolic logic > Computability theory > NP-complete problems

Preferred term

NP-complete problems  

Type

  • Topic

Broader concept

Entry terms

  • NP-completeness

Identifier

  • HUME63993

In other languages

URI

http://data.ub.uio.no/humord/c63993

Download this concept:

RDF/XML TURTLE JSON-LD Created 3/5/24, last modified 3/5/24