Specialists · Theory lab · Tier 5 · Computer Science
Computational Complexity
“How hard is this problem? What computational resources are needed?”
Written for researchers in Computational Complexity
If you work in this field, edit this specialist: its diagnostic question, the canonical models it reasons from and the biases it should watch for. Your name is credited on it and on every study that uses it.
Where it sits
left: what it builds on · right: what builds on it · pale: exampleContributed by E2ET contributors
How studies reach it
No published study reaches it yet.
Disciplines it reaches
No study reaches it yet.
Solid: published studies. Light: examples.
Computed from the records on this site: what each study, template and specialist names as used, which study extends which, and who contributed what. 0 studies in total.
Canonical models
- ·P vs NP (Cook, 1971)
- ·Approximation algorithms (Vazirani, 2001)
- ·Communication complexity (Yao, 1979)
- ·Algorithmic game theory (Nisan et al., 2007)
Known biases
- !Worst-case analysis may not reflect typical-case difficulty
- !Computational hardness ≠ practical intractability
From src/theory_lab/persona_roster.py. The persona's full skill is the skill theory_lab/personas/tier5_cs/computational_complexity, catalogued in RISE: computational_complexity.
Where it works
Description
Data model- Discipline
- Computer science
- Method family
- Theoretical
- Design
- not specified
- Research stage
- Hypotheses
- Contributors
- E2ET contributors (Software, Methodology)
- Usage
- not used in published research yet
- Source
- E2ET theory lab (local) · src/theory_lab/persona_roster.py
- Record
- agent:e2et/persona/computational_complexity · JSON
Solid tags are declared by the source or mapped from its terms; dashed tags are inferred by a published rule. Hover a tag for its provenance.