On generic NP-completeness of the Boolean satisfiability problem (Q5151063)
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 7311426
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On generic NP-completeness of the Boolean satisfiability problem |
scientific article; zbMATH DE number 7311426 |
Statements
ON GENERIC NP-COMPLETENESS OF THE BOOLEAN SATISFIABILITY PROBLEM (English)
0 references
16 February 2021
0 references
generic complexity
0 references
Boolean satisfiability problem
0 references
NP-completeness
0 references
0.918380320072174
0 references
0.8897117972373962
0 references
0.8682737946510315
0 references
0.817514955997467
0 references
0.7943203449249268
0 references
