Strong partial clones and the time complexity of SAT problems (Q340559)
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: Strong partial clones and the time complexity of SAT problems |
scientific article; zbMATH DE number 6652739
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong partial clones and the time complexity of SAT problems |
scientific article; zbMATH DE number 6652739 |
Statements
Strong partial clones and the time complexity of SAT problems (English)
0 references
14 November 2016
0 references
satisfiability problems
0 references
computational complexity
0 references
clone theory
0 references
universal algebra
0 references
subexponential time
0 references
0 references
0 references
0.9076987504959106
0 references
0.8243146538734436
0 references
0.8185660243034363
0 references
0.8144427537918091
0 references
0.805594265460968
0 references
