Pages that link to "Reduction (complexity)"
Jump to navigation
Jump to search
The following pages link to Reduction (complexity):
Displaying 50 items.
- Algorithm (links)
- Block cipher (links)
- Boolean satisfiability problem (links)
- P versus NP problem (links)
- Reduction (links)
- Pseudorandom number generator (links)
- NP-hardness (links)
- P-complete (links)
- Binary symmetric channel (links)
- Polynomial-time reduction (links)
- Hypercomputation (links)
- Component (graph theory) (links)
- How to Solve It (links)
- Many-one reduction (links)
- Bottleneck traveling salesman problem (links)
- Approximation algorithm (links)
- Parameterized complexity (links)
- Quantum algorithm (links)
- Cook–Levin theorem (links)
- Function problem (links)
- Information-theoretic security (links)
- List of terms relating to algorithms and data structures (links)
- Parsing expression grammar (links)
- K-minimum spanning tree (links)
- Log-space reduction (links)
- Complete (complexity) (links)
- List of undecidable problems (links)
- Betweenness problem (links)
- Problem solving (links)
- Matrix chain multiplication (links)
- Rado's theorem (Ramsey theory) (links)
- List of NP-complete problems (links)
- Feedback arc set (links)
- Hashiwokakero (links)
- Goldwasser–Micali cryptosystem (links)
- Truth-table reduction (links)
- Exact cover (links)
- Degree-constrained spanning tree (links)
- Reduce (complexity) (redirect page) (links)
- NL-complete (links)
- Schaefer's dichotomy theorem (links)
- PLS (complexity) (links)
- Computational hardness assumption (links)
- Outline of computer programming (links)
- First-order reduction (links)
- Gadget (computer science) (links)
- PTAS reduction (links)
- Convex hull algorithms (links)
- Algorithmic reducibility (redirect page) (links)
- Holographic algorithm (links)