On Problems as Hard as CNF-SAT (Q4962605)
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: On Problems as Hard as CNF-SAT |
scientific article; zbMATH DE number 6972766
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Problems as Hard as CNF-SAT |
scientific article; zbMATH DE number 6972766 |
Statements
On Problems as Hard as CNF-SAT (English)
0 references
5 November 2018
0 references
optimal growth rate
0 references
reduction
0 references
satisfiability
0 references
strong exponential-time hypothesis
0 references
