Satisfiability algorithms and lower bounds for Boolean formulas over finite bases (Q2946392)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6482811
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Satisfiability algorithms and lower bounds for Boolean formulas over finite bases |
scientific article; zbMATH DE number 6482811 |
Statements
Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases (English)
0 references
16 September 2015
0 references
Boolean formula
0 references
satisfiability algorithm
0 references
average-case lower bound
0 references
random restriction
0 references
0 references
0 references
0 references
0.8850858807563782
0 references
0.7728947401046753
0 references
0.7718143463134766
0 references
0.7661280632019043
0 references
