A Solution of the P versus NP Problem

08/11/2017
by   Norbert Blum, et al.
0

Berg and Ulfberg and Amano and Maruoka have used CNF-DNF-approximators to prove exponential lower bounds for the monotone network complexity of the clique function and of Andreev's function. We show that these approximators can be used to prove the same lower bound for their non-monotone network complexity. This implies P not equal NP.

READ FULL TEXT
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
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
12/07/2020

Monotone Circuit Lower Bounds from Robust Sunflowers

Robust sunflowers are a generalization of combinatorial sunflowers that ...
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...
research
02/01/2021

Sampling and Complexity of Partition Function

The number partition problem is a well-known problem, which is one of 21...
research
03/21/2020

Black-box Methods for Restoring Monotonicity

In many practical applications, heuristic or approximation algorithms ar...
research
05/02/2022

A Critique of Uribe's "P vs. NP"

In this critique, we examine the technical report by Daniel Uribe entitl...

Please sign up or login with your details

Forgot password? Click here to reset