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 this page instead for the normal view: The \(k\)-SATISFIABILITY problem remains NP-complete for dense families |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \(k\)-SATISFIABILITY problem remains NP-complete for dense families |
scientific article |
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
