Détails bibliographiques
| Titre: |
A Critique of Lin's 'On $\text{NP}$ versus $\text{coNP}$ and Frege Systems' |
| Auteurs: |
DeJesse, Nicholas, Lyudovyk, Spencer, Pai, Dhruv, Reidy, Michael |
| Année de publication: |
2025 |
| Collection: |
Computer Science |
| Mots-clés sujets: |
Computer Science - Computational Complexity |
| Description: |
In this paper, we examine Lin's "On NP versus coNP and Frege Systems" [Lin25]. Lin claims to prove that $\text{NP} \neq \text{coNP}$ by constructing a language $L_d$ such that $L_d \in \text{NP}$ but $L_d \notin \text{coNP}$. We present a flaw in Lin's construction of $D$ (a nondeterministic Turing machine that supposedly recognizes $L_d$ in polynomial time). We also provide a proof that $L_d \not\in \text{NP}$. In doing so, we demonstrate that Lin's claim that $\text{NP} \neq \text{coNP}$ is not established by his paper. In addition, we note that a number of further results that Lin claims are not validly established by his paper. |
| Type de document: |
Working Paper |
| URL d'accès: |
http://arxiv.org/abs/2505.05658 |
| Numéro d'inventaire: |
edsarx.2505.05658 |
| Base de données: |
arXiv |