Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108): Difference between revisions
From MaRDI portal
Latest revision as of 05:33, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Parameterized and subexponential-time complexity of satisfiability problems and applications |
scientific article |
Statements
Parameterized and subexponential-time complexity of satisfiability problems and applications (English)
0 references
11 December 2015
0 references
circuit satisfiability
0 references
parameterized complexity
0 references
subexponential-time complexity
0 references
0 references