Pages that link to "NP-completeness"
From HandWiki
The following pages link to NP-completeness:
Displayed 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- ASR-complete (← links)
- Combinatorial optimization (← links)
- Computational social choice (← links)
- Cook–Levin theorem (← links)
- Degree (graph theory) (← links)
- Dynamic epistemic logic (← links)
- Formal methods (← links)
- Geometric set cover problem (← links)
- Glossary of artificial intelligence (← links)
- Las Vegas algorithm (← links)
- Real RAM (← links)
- Spatial analysis (← links)
- Approximation algorithm (← links)
- Asymptotic computational complexity (← links)
- Quantum supremacy (← links)
- P versus NP problem (← links)
- BQP (← links)
- Feedback arc set (← links)
- Seifert surface (← links)
- Tree spanner (← links)
- Topological graph (← links)
- Universal algebra (← links)
- Treewidth (← links)
- Contraction hierarchies (← links)
- Bipartite dimension (← links)
- Grover's algorithm (← links)
- True quantified Boolean formula (← links)
- Quantum counting algorithm (← links)
- Vertex cover (← links)
- Travelling salesman problem (← links)
- Independent set (graph theory) (← links)
- Clique problem (← links)
- Hamiltonian path problem (← links)
- Bend minimization (← links)
- Simultaneous embedding (← links)
- Word-representable graph (← links)
- Partial k-tree (← links)
- Interchangeability algorithm (← links)
- Tree decomposition (← links)
- Obliq (← links)
- Register allocation (← links)
- NP (complexity) (← links)
- NP-hardness (← links)
- PPAD (complexity) (← links)
- System on a chip (← links)
- Parsimonious reduction (← links)
- Hitori (← links)
- TFNP (← links)
- Minimum-weight triangulation (← links)
- Subset sum problem (← links)
