Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity
From MaRDI portal
Publication:5363030
DOI10.1137/1.9781611973730.18zbMath1371.68123OpenAlexW3136261533MaRDI QIDQ5363030
Rahul Santhanam, R. Ryan Williams
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973730.18
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
This page was built for publication: Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity