The \(k\)-SATISFIABILITY problem remains NP-complete for dense families (Q1322290)
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 562678
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(k\)-SATISFIABILITY problem remains NP-complete for dense families |
scientific article; zbMATH DE number 562678 |
Statements
The \(k\)-SATISFIABILITY problem remains NP-complete for dense families (English)
0 references
2 January 1995
0 references
\(k\)-SATISFIABILITY problem
0 references
NP-complete
0 references
0.8443045616149902
0 references
0.8384251594543457
0 references
0.8255385756492615
0 references
0.8247286677360535
0 references
