1 citations · 1 across the 7 of their papers we have counts for
Showing cs.CCShow all
3 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
On Lev Gordeev's "On P Versus NP"
David Narváez, Patrick Phillips
In the paper "On P versus NP," Lev Gordeev attempts to extend the method of approximation, which successfully proved exponential lower bounds for monotone circuits, to the case of…
cs.CC2021
On Salum's Algorithm for
Arian Nadjimzadah, David E. Narváez
This is a commentary on, and critique of, Latif Salum's paper titled "Tractability of One-in-three : ." Salum purports to give a polynomial…