Misplaced Pages

The following pages link to David S. Johnson

• (link count
• transclusion count
• sorted list) · See help page for transcluding these entries

Showing 50 items.

• Boolean satisfiability problem (links | edit)
• P versus NP problem (links | edit)
• Computational complexity (links | edit)
• List of computer scientists (links | edit)
• Computational complexity theory (links | edit)
• Knapsack problem (links | edit)
• Travelling salesman problem (links | edit)
• Unary numeral system (links | edit)
• Subset sum problem (links | edit)
• Quadratic programming (links | edit)
• Minimum spanning tree (links | edit)
• Linear programming (links | edit)
• NP-hardness (links | edit)
• PSPACE-complete (links | edit)
• NP-easy (links | edit)
• NP-equivalent (links | edit)
• Post correspondence problem (links | edit)
• Hamiltonian path problem (links | edit)
• Polynomial-time reduction (links | edit)
• Quadratic residue (links | edit)
• Directed acyclic graph (links | edit)
• Hypergraph (links | edit)
• Ronald Graham (links | edit)
• Graph isomorphism (links | edit)
• Clique problem (links | edit)
• Bin packing problem (links | edit)
• Andrew Yao (links | edit)
• Leonid Levin (links | edit)
• Bottleneck traveling salesman problem (links | edit)
• Graph coloring (links | edit)
• Subgraph isomorphism problem (links | edit)
• Steiner tree problem (links | edit)
• Complexity class (links | edit)
• Complete bipartite graph (links | edit)
• Vertex cover (links | edit)
• Approximation algorithm (links | edit)
• Matching (graph theory) (links | edit)
• PQ tree (links | edit)
• Polynomial hierarchy (links | edit)
• Cook–Levin theorem (links | edit)
• Complete coloring (links | edit)
• Volker Strassen (links | edit)
• Johan Håstad (links | edit)
• Euclidean minimum spanning tree (links | edit)
• L (complexity) (links | edit)
• David Johnson (links | edit)
• Circle graph (links | edit)
• László Lovász (links | edit)
• Quadratic assignment problem (links | edit)
• Jeffrey Ullman (links | edit)