Papers on NP=coNP by Haeusler
JOSEPH SHIPMAN
joeshipman at aol.com
Sun Nov 14 01:11:59 EST 2021
https://arxiv.org/pdf/2012.07833.pdf
https://arxiv.org/pdf/2101.00003.pdf
https://arxiv.org/pdf/2009.09802.pdf
One of these credits Zach, Chow, and myself for asking questions here that helped him sharpen his thinking.
The core of the claimed proof is an argument that a tautology has so much redundancy in its super-polynomially sized proofs in a certain system that a polynomial-size object can be defined that collapses the proof in a way that can be polynomially verified. Further details appear in some of the references.
Does anyone know if these preprints have been referred yet?
— JS
Sent from my iPhone
-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20211114/e6f86d74/attachment.html>
More information about the FOM
mailing list