Strong partial clones and the time complexity of SAT problems (Q340559): Difference between revisions
From MaRDI portal
Latest revision as of 22:22, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Strong partial clones and the time complexity of SAT problems |
scientific article |
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