1 citations · 2 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2021★ 1 cited
Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting
Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah +1
Cai and Hemachandra used iterative constant-setting to prove that Few P (and thus that FewP P). In this paper, we note that there is a tensi…
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…