A simplified NP-complete MAXSAT problem (Q293164)
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: A simplified NP-complete MAXSAT problem |
scientific article; zbMATH DE number 6590655
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simplified NP-complete MAXSAT problem |
scientific article; zbMATH DE number 6590655 |
Statements
A simplified NP-complete MAXSAT problem (English)
0 references
9 June 2016
0 references
computational complexity
0 references
0.8777827620506287
0 references
0.8425028920173645
0 references
0.8387645483016968
0 references
0.8285373449325562
0 references
0.8168867230415344
0 references
