Pages that link to "Computers and Intractability: A Guide to the Theory of NP-Completeness"
The following pages link to Computers and Intractability: A Guide to the Theory of NP-Completeness:
Showing 19 items.
- Knapsack problem (links)
- Graph isomorphism problem (links)
- Minimum-weight triangulation (links)
- Edge cover (links)
- Set packing (links)
- Linear programming (links)
- PSPACE-complete (links)
- Post correspondence problem (links)
- Cut (graph theory) (links)
- Multipartite graph (links)
- Maximum cut (links)
- Bipartite dimension (links)
- Gadget (computer science) (links)
- List of PSPACE-complete problems (links)
- Shortest common supersequence (links)
- Graph bandwidth (links)
- Exact cover (links)
- Set splitting problem (links)
- True quantified Boolean formula (links)