The complexity of model checking for Boolean formulas (Q3569272)
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 5723427
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of model checking for Boolean formulas |
scientific article; zbMATH DE number 5723427 |
Statements
THE COMPLEXITY OF MODEL CHECKING FOR BOOLEAN FORMULAS (English)
0 references
18 June 2010
0 references
0.7939056158065796
0 references
0.791959285736084
0 references
0.7849046587944031
0 references
0.7737411856651306
0 references
