A fast algorithm for SAT in terms of formula length (Q2118334)
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: A fast algorithm for SAT in terms of formula length |
scientific article; zbMATH DE number 7495590
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for SAT in terms of formula length |
scientific article; zbMATH DE number 7495590 |
Statements
A fast algorithm for SAT in terms of formula length (English)
0 references
22 March 2022
0 references
parameterized algorithms
0 references
satisfiability
0 references
measure-and-conquer
0 references
