[Proof Complexity] P.H. Collapses. Pre-print.

Valentin Bura valentin.bura at yahoo.com
Wed Jun 26 22:20:58 CEST 2019

Dear all,
Apologies for re-posting this notice, however the relevant links were missing from my initial post. So here it is, my proof that The Polynomial Hierarchy Collapses to the level coNP \subseteq NP \setminus P. https://arxiv.org/abs/1808.02821

The article is in its fifth version on arXiv, and what has started with a very humble attempt at proving bounds for a SAT variant, was transformed into what I think to be a proof of an important question in Computer Science.

I would like to receive feedback, if your time and efforts permit. I know this may not always be the case, in which event I hope you'll enjoy the easy, accessible treatment of a not-so-straightforward problem.  

Best regards, Valentin Bura

valentin.bura at gmail.com | ValentinBura.net

More information about the Proof-Complexity mailing list