Pages that link to "David S. Johnson"
From Wikipedia, the free encyclopedia
The following pages link to David S. Johnson
View (previous 50) (next 50) (20 | 50 | 100 | 250 | 500)
- Boolean satisfiability problem (links)
- List of computer scientists (links)
- Computational complexity theory (links)
- Knapsack problem (links)
- Travelling salesman problem (links)
- Subset sum problem (links)
- Quadratic programming (links)
- Linear programming (links)
- NP-hard (links)
- PSPACE-complete (links)
- Post correspondence problem (links)
- Hamiltonian path problem (links)
- Quadratic residue (links)
- Clique problem (links)
- Bin packing problem (links)
- Independent set problem (links)
- Bottleneck traveling salesman problem (links)
- Graph coloring (links)
- Subgraph isomorphism problem (links)
- List of important publications in computer science (links)
- Spanning tree (mathematics) (links)
- Complexity class (links)
- User talk:Mellum (links)
- Vertex cover (links)
- Matching (links)
- Polynomial hierarchy (links)
- Complete coloring (links)
- Wikipedia:People by year/Reports/No other categories/1 (links)
- L (complexity) (links)
- Talk:David Johnson (links)
- David Johnson (links)
- Circle graph (links)
- Quadratic assignment problem (links)
- Metric dimension (graph theory) (links)
- List of NP-complete problems (links)
- Michael Garey (links)
- Dominating set problem (links)
- Dominating set (links)
- Domatic number (links)
- Maximal independent set (links)
- Feedback vertex set (links)
- Feedback arc set (links)
- Monochromatic triangle (links)
- Graph isomorphism problem (links)
- Set packing (links)
- Cut (graph theory) (links)
- Shortest common supersequence (links)
- Exact cover (links)
- Degree-constrained spanning tree (links)
- One-in-three 3SAT (links)
