Exponential complexity of satisfiability testing for linear-size Boolean formulas (Q4924642)
From MaRDI portal
!
WARNING
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 6171999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exponential complexity of satisfiability testing for linear-size Boolean formulas |
scientific article; zbMATH DE number 6171999 |
Statements
Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas (English)
0 references
7 June 2013
0 references
0.7928456664085388
0 references
0.7848645448684692
0 references
0.7845905423164368
0 references
0.7822561264038086
0 references
0.7802718877792358
0 references
