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 111 pages are in this category, out of 111 total.
B
C
H
I
M
S
- SameGame
- (SAT, ε-UNSAT)
- Satisfiability modulo theories
- Set cover problem
- Set splitting problem
- Set TSP problem
- Shakashaka
- Shikaku
- Slitherlink
- Smallest grammar problem
- Steiner tree problem
- String graph
- String-to-string correction problem
- Biology:Structural alignment
- Subgraph isomorphism problem
- Substructure search
- Sudoku
T
V
X
Licensed under CC BY-SA 3.0 | Source: https://handwiki.org/wiki/Category:NP-complete_problems37 views | ↧ Download this article as ZWI file
EncycloReader
is supported by the 
KSF