Pages that link to "NP-hard"

The following pages link to NP-hard:

Displaying 26 items.

• Boolean satisfiability problem (← links | edit)
• P versus NP problem (← links | edit)
• Computational complexity theory (← links | edit)
• Gaussian elimination (← links | edit)
• NP (complexity) (← links | edit)
• Quantum computing (← links | edit)
• Quantum entanglement (← links | edit)
• Regular language (← links | edit)
• Tetris (← links | edit)
• Travelling salesman problem (← links | edit)
• The Art of Computer Programming (← links | edit)
• Quadratic programming (← links | edit)
• Minimum spanning tree (← links | edit)
• Linear programming (← links | edit)
• Golomb ruler (← links | edit)
• Monotonic function (← links | edit)
• Boolean ring (← links | edit)
• NP-equivalent (← links | edit)
• Genomics (← links | edit)
• Load balancing (computing) (← links | edit)
• Auction (← links | edit)
• Lemmings (video game) (← links | edit)
• Conjunctive normal form (← links | edit)
• Sequence alignment (← links | edit)
• Phylogenetic tree (← links | edit)
• Polynomial-time reduction (← links | edit)