Pages that link to "Reduction (complexity)"
From HandWiki
The following pages link to Reduction (complexity):
Displayed 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Algorithm (← links)
- Binary symmetric channel (← links)
- Component (graph theory) (← links)
- Computational complexity theory (← links)
- Cook–Levin theorem (← links)
- Kronecker substitution (← links)
- NP-completeness (← links)
- Pattern language (formal languages) (← links)
- Approximation algorithm (← links)
- Complete (complexity) (← links)
- Geometric complexity theory (← links)
- Matrix chain multiplication (← links)
- Parameterized complexity (← links)
- List of NP-complete problems (← links)
- List of undecidable problems (← links)
- Problem solving (← links)
- P versus NP problem (← links)
- Approximation-preserving reduction (← links)
- Betweenness (← links)
- Feedback arc set (← links)
- Gap reduction (← links)
- Holographic algorithm (← links)
- K-minimum spanning tree (← links)
- Pseudorandom number generator (← links)
- PTAS reduction (← links)
- Rendezvous hashing (← links)
- Token reconfiguration (← links)
- Exact cover (← links)
- Rado's theorem (Ramsey theory) (← links)
- First-order reduction (← links)
- Outline of computer programming (← links)
- Circuit satisfiability problem (← links)
- Boolean satisfiability problem (← links)
- Nondeterministic constraint logic (← links)
- Matroid intersection (← links)
- Bottleneck traveling salesman problem (← links)
- Clique cover (← links)
- Function problem (← links)
- Zero-weight cycle problem (← links)
- Halting problem (← links)
- Planar SAT (← links)
- Schaefer's dichotomy theorem (← links)
- Hashiwokakero (← links)
- Computational hardness assumption (← links)
- NP-hardness (← links)
- PLS (complexity) (← links)
- Turing reduction (← links)
- How to Solve It (← links)
- Truth-table reduction (← links)
- Gadget (computer science) (← links)