On the complexity of unfrozen problems (Q2581544)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2244798
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of unfrozen problems |
scientific article; zbMATH DE number 2244798 |
Statements
On the complexity of unfrozen problems (English)
0 references
10 January 2006
0 references
Frozen complexity
0 references
NP-completeness
0 references
Graph coloring
0 references
Satisfiability
0 references
Hamiltonian cycle
0 references
Subgraph isomorphism
0 references
0.7952158451080322
0 references
0.7533941864967346
0 references
0.752059817314148
0 references
0.7488864064216614
0 references
