most citedA Lower Bound for Boolean Satisfiability on Turing Machines

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing cs.CCShow all

2 papers · 1 filter

cs.CC2014

A Lower Bound of Conditional Branches for Boolean Satisfiability on Post Machines

Samuel C. Hsieh

We establish a lower bound of conditional branches for deciding the satisfiability of the conjunction of any two Boolean formulas from a set called a full representation of B…

cs.CC2014★ 1 cited

A Lower Bound for Boolean Satisfiability on Turing Machines

Samuel C. Hsieh

We establish a lower bound for deciding the satisfiability of the conjunction of any two Boolean formulas from a set called a full representation of Boolean functions of variab…