DeepAI AI Chat
Log In Sign Up

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."

12/11/2021
by   Michael C. Chavrimootoo, et al.
0

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 on P versus NP problem." The paper claims to present a polynomial-time algorithm that decides CNF-SAT. We show that the paper's analysis is flawed and that the fundamental underpinning of its algorithm requires an exponential number of steps on infinitely many inputs.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/06/2018

Complexity of the CNF-satisfiability problem

This paper is devoted to the complexity of the Boolean satisfiability pr...
01/11/2021

Freezing sandpiles and Boolean threshold networks: equivalence and complexity

The NC versus P-hard classification of the prediction problem for sandpi...
07/08/2021

The Satisfiability Problem for a Quantitative Fragment of PCTL

We give a sufficient condition under which every finite-satisfiable form...
02/20/2020

Intermediate problems in modular circuits satisfiability

In arXiv:1710.08163 a generalization of Boolean circuits to arbitrary fi...
09/09/2011

Generalizing Boolean Satisfiability III: Implementation

This is the third of three papers describing ZAP, a satisfiability engin...
08/26/2020

Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism

The CNF formula satisfiability problem (CNF-SAT) has been reduced to man...