Cover Image

Ontológico: argumento para CoNP×NP e PvsNP

Fuente: Zenodo

Saved in:

Bibliographic Details
Main Author:	Brito, Pedro
Format:	Recurso digital
Published:	Zenodo 2026
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Ontológico: argumento para CoNP×NP e PvsNP
by: Brito, Pedro
Published: (2026)

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

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

P=NP
by: Deng, Zikang
Published: (2024)

Wataridori is NP-Complete
by: Ruangwises, Suthee
Published: (2026)

Evolomino is NP-complete
by: Nikolaev, Andrei V.
Published: (2025)

P vs. NP
by: Uribe, Daniel
Published: (2016)

On P Versus NP
by: Gordeev, Lev
Published: (2020)

P not equal to NP
by: Delgado, Daniel Cardona
Published: (2023)

Tokenisation is NP-Complete
by: Whittington, Philip, et al.
Published: (2024)

The Separation of $NP$ and $PSPACE$
by: Lin, Tianrong
Published: (2021)

Nondango is NP-Complete
by: Ruangwises, Suthee
Published: (2023)

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
by: Lee, Changryeol
Published: (2026)

NP vs. coNP as an Observer Constraint: A Physics-Informed Framework
by: Fernandes, Ricardo Miguel Machado
Published: (2025)

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

Mim-Width is paraNP-complete
by: Bergougnoux, Benjamin, et al.
Published: (2025)

The Observer in P vs NP
by: Turishchev, Alexander
Published: (2026)

L is different from NP
by: Montoya, J. Andres
Published: (2024)

The Quiver Problem is NP Complete
by: Kac, Victor, et al.
Published: (2025)

Exploring P versus NP
by: Tang, Jian-Gang
Published: (2022)

Grassmannian optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2024)

Broadcast Graph Is NP-complete
by: Xu, Jinghan, et al.
Published: (2024)

The 7 faces of quantum NP
by: Gharibian, Sevag
Published: (2023)

NP-hard problems are not in BQP
by: Czerwinski, Reiner
Published: (2023)

An NP-hard generalization of Nim
by: Liu, Chunlei
Published: (2024)

BusOut is NP-complete
by: Ishibashi, Takehiro, et al.
Published: (2025)

Stiefel optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2025)

A proof of P!=NP
by: McCallum, Rupert
Published: (2020)

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

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

Recognizing Sumsets is NP-Complete
by: Abboud, Amir, et al.
Published: (2024)

NP-Engine: Empowering Optimization Reasoning in Large Language Models with Verifiable Synthetic NP Problems
by: Li, Xiaozhe, et al.
Published: (2025)

Abel's Revenge: The Death of P = NP
by: Eva, Moss
Published: (2026)

Posible prueba de P ≠ NP
by: Salazar Molina, Andy Ariel
Published: (2026)

Determining the Outerthickness of Graphs Is NP-Hard
by: Lee, Pin-Hsian, et al.
Published: (2026)

Deciding DFA-Primality is NP-Hard
by: Spenner, Daniel Alexander
Published: (2026)

Markets are competitive if and only if P != NP
by: Maymin, Philip Z.
Published: (2026)

NP-hardness of SVP in Euclidean Space
by: Wan, Daqing
Published: (2026)

Min-1-Planarity is NP-Hard
by: Okada, Yuto
Published: (2026)

Why Districting Becomes NP-hard
by: Jost, Niklas, et al.
Published: (2025)