Imagen de Portada

On P Versus NP

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Gordeev, Lev
Formato:	Preprint
Publicado:	2020
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Proofs of NP = coNP = PSPACE: Current upgrade
por: Gordeev, Lev, et al.
Publicado: (2023)

A note on Jerabek's paper "A simplified lower bound for implicational logic"
por: Gordeev, Lev, et al.
Publicado: (2026)

P=NP
por: Deng, Zikang
Publicado: (2024)

P vs. NP
por: Uribe, Daniel
Publicado: (2016)

A Critique of Deng's "P=NP"
por: Humphreys, Isabel, et al.
Publicado: (2025)

Some conditions implying if P=NP then P=PSPACE
por: Rodriguez, Ismael
Publicado: (2026)

The $\text{FP}^\text{NP}$ versus #P dichotomy for #EO
por: Meng, Boning, et al.
Publicado: (2025)

Topological Collapse: P = NP Implies #P = FP via Solution-Space Homology
por: Alasli, M.
Publicado: (2026)

Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP
por: Çivril, Ali
Publicado: (2021)

Wataridori is NP-Complete
por: Ruangwises, Suthee
Publicado: (2026)

Nondango is NP-Complete
por: Ruangwises, Suthee
Publicado: (2023)

On $NP \cap coNP$ proof complexity generators
por: Krajicek, Jan
Publicado: (2025)

A proof of P!=NP
por: McCallum, Rupert
Publicado: (2020)

A Critique of Lin's "On $\text{NP}$ versus $\text{coNP}$ and Frege Systems"
por: DeJesse, Nicholas, et al.
Publicado: (2025)

BusOut is NP-complete
por: Ishibashi, Takehiro, et al.
Publicado: (2025)

Communication Complexity is NP-hard
por: Hirahara, Shuichi, et al.
Publicado: (2025)

On Kernelization with Access to NP-Oracles
por: Molter, Hendrik, et al.
Publicado: (2025)

NP-Completeness of Neighborhood Balanced Colorings
por: Asaeedi, Saeed
Publicado: (2024)

The 2-Attractor Problem is NP-Complete
por: Fuchs, Janosch, et al.
Publicado: (2023)

An Intrinsic Barrier for Resolving P = NP (2-SAT as Flat, 3-SAT as High-Dimensional Void-Rich)
por: Alasli, M.
Publicado: (2025)

NP-Completeness of Multicast Beamforming in Wireless Communication
por: Shrestha, Sagar
Publicado: (2025)

Scheme-theoretic Approach to Computational Complexity II. The Separation of P and NP over $\mathbb{C}$, $\mathbb{R}$, and $\mathbb{Z}$
por: Çivril, Ali
Publicado: (2021)

There is a Hyper-Greedoid lurking behind every Graphical Accessible Computational Search Problem solvable in Polynomial Time: $P \not= NP$
por: Kayibi, Koko-Kalambay Kalafan
Publicado: (2018)

Optimizing for aggressive-style strategies in Flesh and Blood is NP-hard
por: Romão, Leonardo Gasparini, et al.
Publicado: (2025)

On the NP-Hardness Approximation Curve for Max-2Lin(2)
por: Martinsson, Björn
Publicado: (2024)

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound
por: Mosievskiy, Matvey, et al.
Publicado: (2026)

Limits of structures and Total NP Search Problems
por: Ježil, Ondřej
Publicado: (2023)

The 7 faces of quantum NP
por: Gharibian, Sevag
Publicado: (2023)

Towards Solving NP-Complete and Other Hard Problems Efficiently in Practice
por: Digulescu, Mircea-Adrian
Publicado: (2026)

An Oracle with no $\mathrm{UP}$-Complete Sets, but $\mathrm{NP}=\mathrm{PSPACE}$
por: Dingel, David, et al.
Publicado: (2024)

Limit-sure reachability for small memory policies in POMDPs is NP-complete
por: Asadi, Ali, et al.
Publicado: (2024)

NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
por: Baraskar, Omkar, et al.
Publicado: (2024)

Determining unit distance graphs with coordinates in $\mathbb{Z}^2$ is NP-complete
por: Binnendyk, Eric
Publicado: (2025)

King Chasing Problem in Chinese Chess is NP-hard
por: Li, Chao, et al.
Publicado: (2026)

Constructing $\mathrm{NP}^{\mathord{\#}\mathrm P}$-complete problems and ${\mathord{\#}\mathrm P}$-hardness of circuit extraction in phase-free ZH
por: Mitosek, Piotr
Publicado: (2024)

NP-hardness of SVP in Euclidean Space
por: Wan, Daqing
Publicado: (2026)

Approximating 1-in-3 SAT by linearly ordered hypergraph 3-colouring is NP-hard
por: Krokhin, Andrei, et al.
Publicado: (2025)

Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles
por: Chavrimootoo, Michael C., et al.
Publicado: (2026)

A Brief Note on a Recent Claim About NP-Hard Problems and BQP
por: Chavrimootoo, Michael C.
Publicado: (2024)

A proof of P != NP (New symmetric encryption algorithm against any linear attacks and differential attacks)
por: Ming, Gao
Publicado: (2022)