Pages that link to "NP-completeness"
Jump to navigation
Jump to search
The following pages link to NP-completeness:
Displaying 49 items.
- BQP (← links)
- NP (complexity) (← links)
- Set (card game) (← links)
- Travelling salesman problem (← links)
- Subset sum problem (← links)
- Universal algebra (← links)
- Grover's algorithm (← links)
- Disjunctive normal form (← links)
- System on a chip (← links)
- Tree decomposition (← links)
- Formal methods (← links)
- Tensor (intrinsic definition) (← links)
- Ising model (← links)
- Combinatorial optimization (← links)
- Independent set (graph theory) (← links)
- Vertex cover (← links)
- Approximation algorithm (← links)
- Quantum algorithm (← links)
- Cook–Levin theorem (← links)
- Seifert surface (← links)
- Degree (graph theory) (← links)
- Feedback arc set (← links)
- River crossing puzzle (← links)
- Tree spanner (← links)
- Treewidth (← links)
- Multiple sequence alignment (← links)
- TFNP (← links)
- Quantum annealing (← links)
- Umesh Vazirani (← links)
- Conjunctive query (← links)
- Asymptotic computational complexity (← links)
- SAT solver (← links)
- Bipartite dimension (← links)
- True quantified Boolean formula (← links)
- Minimum-weight triangulation (← links)
- Contraction hierarchies (← links)
- Topological graph (← links)
- Interchangeability algorithm (← links)
- Proportional approval voting (← links)
- Geometric set cover problem (← links)
- Dynamic epistemic logic (← links)
- Quantum counting algorithm (← links)
- Quantum supremacy (← links)
- Parsimonious reduction (← links)
- Rainbow-independent set (← links)
- MacMahon Squares (← links)
- Disjunctive Datalog (← links)
- Theta-subsumption (← links)
- Word equation (← links)