Beating exhaustive search for quantified Boolean formulas and connections to circuit complexity (Q5363030)
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 6786346
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beating exhaustive search for quantified Boolean formulas and connections to circuit complexity |
scientific article; zbMATH DE number 6786346 |
Statements
Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity (English)
0 references
5 October 2017
0 references
0.7916045784950256
0 references
0.7866795659065247
0 references
0.7802528738975525
0 references
0.7738327980041504
0 references
