| Article Details | ||
|---|---|---|
| Title: | Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity | |
| Article URLs: | ||
| Alternative Article URLs: | ||
| Authors: | Rahul Santhanam |
|
| Richard Ryan Williams |
|
|
| Sharing: | Unknown | |
| Verification: | Authors have not verified information | |
| Artifact Evaluation Badge: | none | |
| Artifact URLs: |
|
|
| Artifact Correspondence Email Addresses: |
|
|
| NSF Award Numbers: | 1212372 | |
| DBLP Key: | conf/soda/SanthanamW15 | |
| Author Comments: | ||