1 citations · 1 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2022
A Critique of Uribe's "P vs. NP"
Henry B. Welles
In this critique, we examine the technical report by Daniel Uribe entitled "P vs. NP." The paper claims to show an exponential lower bound on the runtime of algorithms that decide…
cs.CC2021
A Critique of Kumar's "Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in CNF and Its Implications on P versus NP problem."
Michael C. Chavrimootoo, Henry B. Welles
In this paper, we analyze the argument made by Kumar in the technical report "Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in CNF and Its Implications…