NP-complete problems
Topic: Category
From HandWiki - Reading time: 2 min
Here is a list of articles in the category NP-complete problems of the Computing portal that unifies foundations of mathematics and computations using computers. ==See also==
Pages in category "NP-complete problems"
The following 171 pages are in this category, out of 171 total.
B
C
E
G
H
I
L
M
- Software:Mahjong solitaire
- Software:Mastermind (board game)
- Masyu
- Mathematics of paper folding
- Maximum common induced subgraph
- Maximum coverage problem
- Maximum cut
- Biology:Mendelian error
- Software:Minesweeper (video game)
- Minimum k-cut
- Minimum routing cost spanning tree
- Monochromatic triangle
- Multi-commodity flow problem
- Multipartite graph
P
R
S
- SameGame
- (SAT, ε-UNSAT)
- Satisfiability modulo theories
- Set cover problem
- Set packing
- Set splitting problem
- Set TSP problem
- Shakashaka
- Shared risk resource group
- Shikaku
- Shortest common supersequence
- Finance:Single-machine scheduling
- Skew-symmetric graph
- Slitherlink
- Smallest grammar problem
- Star coloring
- Steiner tree problem
- String graph
- String-to-string correction problem
- Strong connectivity augmentation
- Biology:Structural alignment
- Subgraph isomorphism problem
- Substructure search
- Sudoku
- Sum coloring
T
V
X
Licensed under CC BY-SA 3.0 | Source: https://handwiki.org/wiki/Category:NP-complete_problems59 views | ↧ Download this article as ZWI file
EncycloReader
is supported by the 
KSF