Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas

DOI10.1007/978-3-642-38233-8_10zbMath1382.68103OpenAlexW2140202836MaRDI QIDQ4924642

Alexander Wolpert, Evgeny Dantsin

Publication date: 7 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38233-8_10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas