Pages that link to "Reduction (complexity)"
Jump to navigation
Jump to search
The following pages link to Reduction (complexity):
Displaying 50 items.
- Block cipher (← links)
- P versus NP problem (← links)
- Reduction (← links)
- Pseudorandom number generator (← links)
- P-complete (← links)
- Binary symmetric channel (← links)
- Polynomial-time reduction (← links)
- Component (graph theory) (← links)
- Many-one reduction (← links)
- Approximation algorithm (← links)
- Parameterized complexity (← links)
- Quantum algorithm (← links)
- Poncelet–Steiner theorem (← links)
- Cook–Levin theorem (← links)
- Function problem (← links)
- Information-theoretic security (← links)
- Parsing expression grammar (← links)
- K-minimum spanning tree (← links)
- List of undecidable problems (← links)
- Matrix chain multiplication (← links)
- Rado's theorem (Ramsey theory) (← links)
- List of NP-complete problems (← links)
- Feedback arc set (← links)
- Goldwasser–Micali cryptosystem (← links)
- Truth-table reduction (← links)
- Exact cover (← links)
- Degree-constrained spanning tree (← links)
- Schaefer's dichotomy theorem (← links)
- PLS (complexity) (← links)
- Computational hardness assumption (← links)
- First-order reduction (← links)
- PTAS reduction (← links)
- Convex hull algorithms (← links)
- Holographic algorithm (← links)
- Perceptrons (book) (← links)
- Online machine learning (← links)
- Structural complexity theory (← links)
- Schönhardt polyhedron (← links)
- Halting problem (← links)
- Minimum-weight triangulation (← links)
- Matroid intersection (← links)
- NP-completeness (← links)
- QMA (← links)
- Leontief utilities (← links)
- Succinct game (← links)
- Circuit satisfiability problem (← links)
- Rendezvous hashing (← links)
- Gap reduction (← links)
- Approximation-preserving reduction (← links)
- Token reconfiguration (← links)