Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478)
From MaRDI portal
scientific article; zbMATH DE number 7561755
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction |
scientific article; zbMATH DE number 7561755 |
Statements
21 July 2022
0 references
fine-grained complexity theory
0 references
algorithmic classification theorem
0 references
multivariate algorithms and complexity
0 references
constraint satisfaction problems
0 references
satisfiability
0 references
0 references
Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (English)
0 references
