Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity (Q5363030)
From MaRDI portal
scientific article; zbMATH DE number 6786346
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
