Category:NP-complete problems
See also
[edit]Subcategories
This category has the following 9 subcategories, out of 9 total.
Pages in category "NP-complete problems"
The following 181 pages are in this category, out of 181 total. This list may not reflect recent changes.
B
C
D
E
G
H
I
L
M
- Mahjong solitaire
- Mastermind (board game)
- Masyu
- Mathematics of paper folding
- Maximum common induced subgraph
- Maximum coverage problem
- Maximum cut
- Mendelian error
- Metric dimension (graph theory)
- Minesweeper (video game)
- Minimum k-cut
- Minimum routing cost spanning tree
- Monochromatic triangle
- Multi-commodity flow problem
- Multipartite graph
- Multiple sequence alignment
P
R
S
- SameGame
- Satisfiability modulo theories
- Set cover problem
- Set packing
- Set splitting problem
- Set TSP problem
- Shakashaka
- Shared risk resource group
- Shikaku
- Shortest common supersequence
- Single-machine scheduling
- Skew-symmetric graph
- Slitherlink
- Slope number
- Smallest grammar problem
- Sokoban
- Star coloring
- Steiner tree problem
- String graph
- String-to-string correction problem
- Strong connectivity augmentation
- Structural alignment
- Subcoloring
- Subgraph isomorphism problem
- Substructure search
- Sudoku
- Sum coloring
T
- Talent scheduling
- Tatamibari
- Tentai Show
- Tetris
- Theta-subsumption
- Thickness (graph theory)
- Threading (protein sequence)
- Three-dimensional edge-matching puzzle
- Token reconfiguration
- Tolerance graph
- Traveling purchaser problem
- Travelling salesman problem
- Tree alignment
- Tree spanner
- Tree-depth
- Treewidth