Time complexity
flowchart
AA["Associated Authors (0)"]
C[Time complexity]
BC["Broader Concepts (3)"]
NC["Narrower Concepts (12)"]
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/Q2393193
- OpenAlex ID
- https://openalex.org/C311688 (API record)
- OpenAlex Description
- estimate of time taken for running an algorithm
- OpenAlex Level [?]
- 2
Broader Concepts
Narrower Concepts
- Average-case complexity
- Complexity class
- Descriptive complexity theory
- Exponential time hypothesis
- NP-complete
- P
- P versus NP problem
- Polynomial hierarchy
- Polynomial-time approximation scheme
- Tree network
- Vertex cover
- Worst-case complexity
Associated Authors
Add Incoming Edge
Login via ORCiD to contribute.
Add Outgoing Edge
Login via ORCiD to contribute.
HelioWeb