On P Versus NP

05/02/2020
by   Lev Gordeev, et al.
0

I generalize a well-known result that P = NP fails for monotone polynomial circuits - more precisely, that the clique problem CLIQUE(k^4,k) is not solvable by Boolean (AND,OR)-circuits of the size polynomial in k. In the other words, there is no Boolean (AND,OR)-formula F expressing that a given graph with k^4 vertices contains a clique of k elements, provided that the circuit length of F, cl(F), is polynomial in k. In fact, for any solution F in question, cl(F) must be exponential in k. Moreover this holds also for DeMorgan normal (abbr.: DMN) (AND,OR)-formulas F that allow negated variables. Based on the latter observation I consider an arbitrary (AND,OR,NOT)-formula F and recall that standard NOT-conversions to DMN at most double its circuit length. Hence for any Boolean solution F of CLIQUE(k^4,k), cl(F) is exponential in k. I conclude that CLIQUE(k^4,k) is not solvable by polynomial-size Boolean circuits, and hence P is not NP. The entire proof is formalizable by standard methods in the exponential function arithmetic EFA.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/02/2019

A Solution of the P versus NP Problem based on specific property of clique function

Circuit lower bounds are important since it is believed that a super-pol...
research
06/18/2020

On the complexity of detecting hazards

Detecting and eliminating logic hazards in Boolean circuits is a fundame...
research
04/14/2021

On Lev Gordeev's "On P Versus NP"

In the paper "On P versus NP," Lev Gordeev attempts to extend the method...
research
03/06/2018

Local negative circuits and cyclic attractors in Boolean networks with at most five components

We consider the following question on the relationship between the asymp...
research
07/13/2018

Optimal Short-Circuit Resilient Formulas

We consider fault-tolerant boolean formulas in which the output of a fau...
research
12/02/2019

On the relation between structured d-DNNFs and SDDs

Structured d-DNNFs and SDDs are restricted negation normal form circuits...
research
05/07/2020

Critique of Boyu Sima's Proof that P≠ NP

We review and critique Boyu Sima's paper, "A solution of the P versus NP...

Please sign up or login with your details

Forgot password? Click here to reset