1 citations · 1 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
Linked Fates: How Small of an Ambiguity Increase Can Make the Difference Between Equaling and Separating from P?
Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra +3
Ambiguity-bounded versions of , denoted , bound by the number of accepting paths the nondeterministic polynomial-time Turing machine ca…
cs.CC2021
A Critique of Keum-Bae Cho's Proof that
Benjamin Carleton, Michael C. Chavrimootoo, Conor Taliancich
In this paper we critique Keum-Bae Cho's proof that . This proof relates instances of 3-SAT to indistinguishable binomial decision trees and clai…