1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DM2015
Two Answers to a Common Question on Diagonalization
Samuel C. Hsieh
A common question from students on the usual diagonalization proof for the uncountability of the set of real numbers is: when a representation of real numbers, such as the decimal…
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…