Pages that link to "Reduction (complexity)"
The following pages link to Reduction (complexity):
Showing 50 items.
- Complexity reduction (redirect page) (links)
- Algorithm (links)
- Feedback arc set (links)
- Block cipher (links)
- Boolean satisfiability problem (links)
- Convex hull algorithms (links)
- P versus NP problem (links)
- Reduction (links)
- First-order reduction (links)
- Minimum-weight triangulation (links)
- Tetris (links)
- Not-all-equal 3-satisfiability (links)
- Polynomial-time counting reduction (links)
- NL-complete (links)
- Transform and conquer algorithm (redirect page) (links)
- Schaefer's dichotomy theorem (links)
- Pseudorandom number generator (links)
- Security of cryptographic hash functions (links)
- PLS (complexity) (links)
- Reconfiguration (links)
- NP-hardness (links)
- P-complete (links)
- Nondeterministic constraint logic (links)
- Binary symmetric channel (links)
- Succinct game (links)
- Hashiwokakero (links)
- Geometric complexity theory (links)
- Matroid intersection (links)
- Polynomial-time reduction (links)
- Gadget (computer science) (links)
- NP-completeness (links)
- Goldwasser–Micali cryptosystem (links)
- PTAS reduction (links)
- Online machine learning (links)
- Zero-weight cycle problem (links)
- QMA (links)
- Planar SAT (links)
- Algorithmic reducibility (redirect page) (links)
- Reduction (computability) (redirect page) (links)
- Fragment (logic) (links)
- Structural complexity theory (links)
- Reducible (complexity) (redirect page) (links)
- Component (graph theory) (links)
- Reduction (complexity) (transclusion) (links)
- Schönhardt polyhedron (links)
- Truth-table reduction (links)
- Parsing expression grammar (links)
- Reduction (computability theory) (links)
- Exact cover (links)
- Rendezvous hashing (links)