Pages that link to "NP-completeness"
Jump to navigation
Jump to search
The following pages link to NP-completeness:
Displaying 50 items.
- BQP (← links)
- List of computer scientists (← links)
- NP-complete problem (redirect page) (← links)
- NP (complexity) (← links)
- Set (card game) (← links)
- Turing Award (← links)
- Travelling salesman problem (← links)
- Subset sum problem (← links)
- Peg solitaire (← links)
- NP-hardness (← links)
- Grover's algorithm (← links)
- Disjunctive normal form (← links)
- System on a chip (← links)
- Hamiltonian path problem (← links)
- Tree decomposition (← links)
- Formal methods (← links)
- NP-complete problems (redirect to section "NP-complete problems") (← links)
- Clique problem (← links)
- Tensor (intrinsic definition) (← links)
- Ising model (← links)
- Leonid Levin (← links)
- Combinatorial optimization (← links)
- Register allocation (← links)
- Independent set (graph theory) (← links)
- Vertex cover (← links)
- Approximation algorithm (← links)
- David S. Johnson (← links)
- Obliq (← links)
- 1971 in science (← links)
- Quantum algorithm (← links)
- NP complete (redirect page) (← links)
- NP completeness (redirect page) (← links)
- Cook–Levin theorem (← links)
- Metaheuristic (← links)
- NP-C (redirect page) (← links)
- Log-space reduction (← links)
- Np complete (redirect page) (← links)
- Np-complete (redirect page) (← links)
- Seifert surface (← links)
- Degree (graph theory) (← links)
- Lattice protein (← links)
- Black Hole (card game) (← links)
- Feedback arc set (← links)
- Lenore Blum (← links)
- River crossing puzzle (← links)
- Nanson's method (← links)
- Hitori (← links)
- ASR-complete (← links)
- Tatamibari (← links)
- Optical computing (← links)