Pages that link to "NP-completeness"
The following pages link to NP-completeness:
Displaying 16 items.
- BQP (← links | edit)
- NP-complete problem (redirect page) (← links | edit)
- NP (complexity) (← links | edit)
- Set (card game) (← links | edit)
- Travelling salesman problem (← links | edit)
- Subset sum problem (← links | edit)
- Peg solitaire (← links | edit)
- Universal algebra (← links | edit)
- NP-hardness (← links | edit)
- Grover's algorithm (← links | edit)
- Disjunctive normal form (← links | edit)
- System on a chip (← links | edit)
- Hamiltonian path problem (← links | edit)
- Tree decomposition (← links | edit)
- Formal methods (← links | edit)
- NP-complete problems (redirect to section "NP-complete problems") (← links | edit)