Pages that link to "Complete (complexity)"
From HandWiki
The following pages link to Complete (complexity):
Displayed 41 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Computational complexity theory (← links)
- Group testing (← links)
- NP-completeness (← links)
- Resource bounded measure (← links)
- Configuration graph (← links)
- Existential theory of the reals (← links)
- Complexity class (← links)
- Arrangement of lines (← links)
- Proof of impossibility (← links)
- BQP (← links)
- Approximation-preserving reduction (← links)
- PTAS reduction (← links)
- Crossing number (graph theory) (← links)
- First-order reduction (← links)
- Oracle machine (← links)
- Clique problem (← links)
- Graph isomorphism problem (← links)
- Part–whole theory (← links)
- One Clean Qubit (← links)
- Steinitz's theorem (← links)
- Computational hardness assumption (← links)
- Digi-Comp II (← links)
- Descriptive Complexity (← links)
- PPAD (complexity) (← links)
- NL-complete (← links)
- Log-space reduction (← links)
- PPA (complexity) (← links)
- Intersection graph (← links)
- SNP (complexity) (← links)
- L (complexity) (← links)
- QMA (← links)
- PPP (complexity) (← links)
- LOGCFL (← links)
- Oblivious transfer (← links)
- UP (complexity) (← links)
- P-complete (← links)
- Reduction (complexity) (← links)
- Games, Puzzles, and Computation (← links)
- Resource-bounded measure (← links)
- Biography:Jean Charles Athanase Peltier (← links)
- Biography:Alexei Kitaev (← links)