Pages that link to "Computers and Intractability"
From HandWiki
The following pages link to Computers and Intractability:
Displayed 28 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- 3-dimensional matching (← links)
- Computational complexity theory (← links)
- Computational complexity (← links)
- Cook–Levin theorem (← links)
- Graph isomorphism (← links)
- NP-completeness (← links)
- List of NP-complete problems (← links)
- P versus NP problem (← links)
- Steiner tree problem (← links)
- Directed acyclic graph (← links)
- Minimum spanning tree (← links)
- Domatic number (← links)
- Intersection number (graph theory) (← links)
- Dominating set (← links)
- Graph isomorphism problem (← links)
- Hamiltonian path problem (← links)
- Bin packing problem (← links)
- NP-equivalent (← links)
- NP-hardness (← links)
- Bipartite half (← links)
- Chordal completion (← links)
- NP-easy (← links)
- Subset sum problem (← links)
- Games, Puzzles, and Computation (← links)
- Theta-subsumption (← links)
- Template:Garey-Johnson (← links)
- Biography:David S. Johnson (← links)
- Biography:Michael Garey (← links)
