Computational complexity theory
flowchart AA["Associated Authors (0)"] C[Computational complexity theory] BC["Broader Concepts (1)"] NC["Narrower Concepts (8)"] C== skos:broader ==>BC NC== skos:broader ==>C AA== dcterms:relation ==>C click BC "#broader-concepts" click NC "#narrower-concepts" click AA "#associated-authors" NI["add incoming edge"] NO["add outgoing edge"] NI-- ? -->C C-- ? -->NO click NI "#add-incoming-edge" click NO "#add-outgoing-edge" style NI stroke-width:2px,stroke-dasharray: 5 5 style NO stroke-width:2px,stroke-dasharray: 5 5
- Wikidata
- https://www.wikidata.org/wiki/Q205084
- OpenAlex ID
- https://openalex.org/C179799912 (API record)
- OpenAlex Description
- theoretical computer science and mathematics theory that classifies problems according to their inherent difficulty, and relates those classes to each other
- OpenAlex Level [?]
- 2
Broader Concepts
Narrower Concepts
- Average-case complexity
- Complexity class
- Computational resource
- Descriptive complexity theory
- NP-complete
- PSPACE
- Polynomial hierarchy
- Worst-case complexity
Associated Authors
Add Incoming Edge
Login via ORCiD to contribute.
Add Outgoing Edge
Login via ORCiD to contribute.