Image de couverture de livre

L is different from NP

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Montoya, J. Andres
Format:	Preprint
Publié:	2024
Sujets:	Computational Complexity F.1.3
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Graph-Based Deterministic Polynomial Framwork for NP Problems
par: Lee, Changryeol
Publié: (2025)

A Note on the NP-Hardness of PARTITION Via First-Order Projections
par: Iturralde, Paúl Risco
Publié: (2025)

Hausdorff Reductions and the Exponential Hierarchies
par: Malizia, Enrico
Publié: (2024)

Separation Results for Constant-Depth and Multilinear Ideal Proof Systems
par: Behera, Amik Raj, et autres
Publié: (2026)

Completing the Complexity Classification of 2-Solo Chess: Knights and Kings are Hard
par: Kühn, Kolja, et autres
Publié: (2026)

Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting
par: Hemaspaandra, Lane A., et autres
Publié: (2021)

Disjunctive Complexity
par: Ivanov, Nikita, et autres
Publié: (2025)

Understanding Robust Catalytic Computing
par: Koucký, Michal, et autres
Publié: (2026)

Complexity Classes Arising from Circuits over Finite Algebraic Structures
par: Kawałek, Piotr, et autres
Publié: (2026)

Catalytic Computing and Register Programs Beyond Log-Depth
par: Alekseev, Yaroslav, et autres
Publié: (2025)

A point to set principle for finite-state dimension
par: Mayordomo, Elvira
Publié: (2022)

Reachability with Restricted Reactions in Inhibitory Chemical Reaction Networks
par: Bajaj, Divya, et autres
Publié: (2026)

Constructibility and the P versus NP problem
par: Hole, Arne
Publié: (2024)

Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations
par: Antonelli, Melissa, et autres
Publié: (2025)

NP-hardness of p-adic linear regression
par: Baker, Gregory D.
Publié: (2026)

Structure of sparse Boolean functions over Abelian groups, and its application to testing
par: Chakraborty, Sourav, et autres
Publié: (2024)

Explicit Commutative ROABPs from Partial Derivatives
par: Bhargava, Vishwas, et autres
Publié: (2024)

On the Complexity of Determinations
par: Hellerstein, Joseph M.
Publié: (2026)

Nonuniform Deterministic Finite Automata over finite algebraic structures
par: Idziak, Paweł M., et autres
Publié: (2025)

Imperative process algebra and models of computation
par: Middelburg, C. A.
Publié: (2022)

Separating QMA from QCMA with a classical oracle
par: Bostanci, John, et autres
Publié: (2025)

Correspondences in computational and dynamical complexity II: forcing complex reductions
par: Everett, Samuel
Publié: (2026)

Arithmetic Complexity of Solutions of the Dirichlet Problem
par: Boche, Holger, et autres
Publié: (2026)

On the Counting Complexity of the Skolem Problem
par: Jindal, Gorav, et autres
Publié: (2024)

Algorithmic hardness of the partition function for nucleic acid strands
par: Ducloz, Gwendal, et autres
Publié: (2025)

Realizable Circuit Complexity: Embedding Computation in Space-Time
par: Prada, Benjamin, et autres
Publié: (2025)

Lower Bounds for CSP Hierarchies Through Ideal Reduction
par: Conneryd, Jonas, et autres
Publié: (2025)

SAT problem and Limit of Solomonoff's inductive reasoning theory
par: Pan, Feng
Publié: (2025)

The Bit Complexity of Dynamic Algebraic Formulas and their Determinants
par: Anand, Emile, et autres
Publié: (2024)

CLIQUE as an AND of Polynomial-Sized Monotone Constant-Depth Circuits
par: Bodnar, Levente
Publié: (2024)

Meta Theorem for Hardness on FCP-Problem
par: Nagao, Atsuki, et autres
Publié: (2025)

Upper and Lower Bounds for the Linear Ordering Principle
par: Hirsch, Edward A., et autres
Publié: (2025)

Linear Matroid Intersection is in Catalytic Logspace
par: Agarwala, Aryan, et autres
Publié: (2025)

Oracle Separations for RPH
par: Hamm, Thekla, et autres
Publié: (2025)

Sign-Rank of $k$-Hamming Distance is Constant
par: Göös, Mika, et autres
Publié: (2025)

A Note on Avoid vs MCSP
par: Hirsch, Edward A., et autres
Publié: (2025)

Diagonalization Without Relativization A Closer Look at the Baker-Gill-Solovay Theorem
par: Garcia, Baruch
Publié: (2026)

Required-edge Cycle Cover Problem: an ASP-Completeness Framework for Graph Problems and Puzzles
par: Susukita, Kosuke, et autres
Publié: (2026)

On Sampling Lower Bounds for Polynomials
par: Khodabandeh, Mohammad Mahdi, et autres
Publié: (2026)

Transitions in Dynamic Point Labeling
par: Depian, Thomas, et autres
Publié: (2022)