Show moreShow less Choose an option to locate/access this article: Check if you have access through your login credentials or your institutionCheck access Purchase $35.95 DOI: 10.1016/0148-9062(74)90310-6 Get rights and contentCopyright © 1974 Published by Elsevier Ltd....
A Lower Bound of 2^n Conditional Jumps for Boolean Satisfiability on A Random Access Machine We establish a lower bound of 2^n conditional jumps for deciding the satisfiability of the conjunction of any two Boolean formulas from a set called a full representation of Boolean functions of n varia...