Cover Image

A proof of P!=NP

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	McCallum, Rupert
Format:	Preprint
Published:	2020
Subjects:	Logic Computational Complexity 03D15
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Semi-Algebraic Proof Systems for QBF
by: Beyersdorff, Olaf, et al.
Published: (2025)

Online and feasible presentability: from trees to modal algebras
by: Bazhenov, Nikolay, et al.
Published: (2025)

Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2025)

A Minimal Substitution Basis for the Kalmár Elementary Functions
by: Prunescu, Mihai, et al.
Published: (2025)

The Golden Path to Guarded Monotone Strict NP
by: Barsukov, Alexey, et al.
Published: (2023)

Generalizing Goodstein's theorem and Cichon's independence proof
by: Wilken, Gunnar
Published: (2025)

Parameterized complexity of the f-Critical Set problem
by: Marcilon, Thiago, et al.
Published: (2025)

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

Deciding winning strategies in Yu-Gi-Oh! TCG is hard
by: Nicolosi, Orazio, et al.
Published: (2026)

Finitely Bounded Homogeneity Turned Inside-Out
by: Rydval, Jakub
Published: (2021)

Adversarial Barrier in Uniform Class Separation
by: Rosko, Milan
Published: (2025)

From Gödel incompleteness to the consistency of circuit lower bounds
by: Atserias, Albert, et al.
Published: (2026)

A note reviewing Turing's 1936
by: Cattabriga, Paola
Published: (2013)

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

Extended Nullstellensatz proof systems
by: Krajicek, Jan
Published: (2023)

Why the classes P and NP are not well-defined finitarily
by: Anand, Bhupinder Singh
Published: (2024)

Computational Complexity of Model-Checking Quantum Pushdown Systems
by: Lin, Deren, et al.
Published: (2025)

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

Open Problems in Computability Theory and Descriptive Set Theory
by: Barmpalias, George, et al.
Published: (2025)

Analogues of the countable Borel equivalence relations in the setting of computable reducibility
by: Andrews, Uri, et al.
Published: (2024)

Formalizing Pfaffian in bounded arithmetic
by: Kuroda, Satoru
Published: (2024)

Benign approximations and non-speedability
by: Hölzl, Rupert, et al.
Published: (2023)

On Some Complexity Results for Even Linear Languages
by: Cojocaru, Liliana
Published: (2024)

The computational content of multidimensional discontinuity
by: Hölzl, Rupert, et al.
Published: (2024)

Dichotomy results for classes of countable graphs
by: Cipriani, Vittorio, et al.
Published: (2025)

Fundamental sequences based on localization
by: Wilken, Gunnar
Published: (2024)

Considering The Satisfiability of Cubic Diophantine Equations
by: Rosko, Milan
Published: (2025)

Automatic structures and the problem of natural well-orderings
by: Beklemishev, Lev D., et al.
Published: (2024)

Strong reducibilities and set theory
by: Schweber, Noah
Published: (2024)

Foundational Analysis Of The Solvability Complexity Index: The Weihrauch-SCI Intermediate Hierarchy
by: Sorg, Christopher
Published: (2026)

Bi-Isolated d.c.e. Degrees and $Σ_1$ Induction
by: Liu, Yong, et al.
Published: (2025)

Isolated d.c.e. degrees and $Σ_1$ induction
by: Liu, Yiqun, et al.
Published: (2025)

Robinson Splitting Theorem and $Σ_1$ Induction
by: Liu, Yong, et al.
Published: (2026)

Computable thermodynamic formalism
by: Binder, Ilia, et al.
Published: (2025)

Randomness versus superspeedability
by: Hölzl, Rupert, et al.
Published: (2024)

Computably discrete represented spaces
by: Neumann, Eike, et al.
Published: (2025)

Hilbert's tenth problem for rings of holomorphic functions of bounded order
by: Pasten, Hector
Published: (2024)

Regainingly approximable numbers and sets
by: Hertling, Peter, et al.
Published: (2023)

Minimal covers in the Weihrauch degrees
by: Lempp, Steffen, et al.
Published: (2023)