Critique of Barbosa's "P != NP Proof"

11/20/2017
by   Jackson Abascal, et al.
0

We review André Luiz Barbosa's paper "P != NP Proof," in which the classes P and NP are generalized and claimed to be proven separate. We highlight inherent ambiguities in Barbosa's definitions, and show that attempts to resolve this ambiguity lead to flaws in the proof of his main result.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2019

Proof compression and NP versus PSPACE. Part 2

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]:...
research
07/08/2019

Proof compression and NP versus PSPACE: Addendum

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]:...
research
04/01/2023

P≠NP relative to a P-complete oracle

The P versus NP problem is still unsolved. But there are several oracles...
research
11/14/2022

Numbers Extensions

Over the course of the last 50 years, many questions in the field of com...
research
11/17/2020

Proof Compression and NP Versus PSPACE II: Addendum

In [3] we proved the conjecture NP = PSPACE by advanced proof theoretic ...
research
11/15/2021

A Chronology of Set Cover Inapproximability Results

It is well-known that an algorithm exists which approximates the NP-comp...

Please sign up or login with your details

Forgot password? Click here to reset