Image de couverture de livre

Diagonalization Without Relativization A Closer Look at the Baker-Gill-Solovay Theorem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Garcia, Baruch
Format:	Preprint
Publié:	2026
Sujets:	Computational Complexity 68Q15 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

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

A Note on Avoid vs MCSP
par: Hirsch, Edward A., 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)

Shifted Partial Derivative Polynomial Rank and Codimension
par: Edwards, Darren J.
Publié: (2025)

Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness
par: Tzameret, Iddo, et autres
Publié: (2023)

Separation of PSPACE and EXP
par: Czerwinski, Reiner
Publié: (2021)

Generalisations of Matrix Partitions : Complexity and Obstructions
par: Barsukov, Alexey, et autres
Publié: (2021)

Leakage-Resilient Hardness Equivalence to Logspace Derandomization
par: Shalunov, Yakov
Publié: (2023)

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

Failure of the strong feasible disjunction property
par: Krajicek, Jan
Publié: (2026)

The Serial Scaling Hypothesis
par: Liu, Yuxi, et autres
Publié: (2025)

An MDL-Style Cost Functional KC, Distribution-Preserving Reductions ($A2^d$), and an $AC^0$+log Lower Bound for 3SAT via Balanced 3XOR
par: Lela, Marko
Publié: (2025)

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

Finitely (In)tractable Promise Constraint Satisfaction Problems
par: Asimi, Kristina, et autres
Publié: (2020)

Dichotomy for orderings?
par: Kun, Gábor, et autres
Publié: (2025)

NP-hard problems are not in BQP
par: Czerwinski, Reiner
Publié: (2023)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
par: Kumar, Mrinal, et autres
Publié: (2018)

IECZ-III: Hardcore Condensation Lift with Size-Aware Invariants
par: Lela, Marko
Publié: (2025)

Explicit separations between randomized and deterministic Number-on-Forehead communication
par: Kelley, Zander, et autres
Publié: (2023)

Polynomial Prenexing of QBFs with Non-Monotone Boolean Operators
par: Saffidine, Abdallah, et autres
Publié: (2025)

Formula Size-Depth Tradeoffs for Iterated Sub-Permutation Matrix Multiplication
par: Rossman, Benjamin
Publié: (2024)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
par: Huseynzade, Rafig
Publié: (2025)

Fixed-parameter debordering of Waring rank
par: Dutta, Pranjal, et autres
Publié: (2024)

Quantum Sabotage Complexity
par: Cornelissen, Arjan, et autres
Publié: (2024)

Completeness classes in algebraic complexity theory
par: Bürgisser, Peter
Publié: (2024)

The Solver's Paradox in Formal Problem Spaces
par: Rosko, Milan
Publié: (2025)

On the computational complexity of Data Flow Analysis
par: Sood, Gaurav, et autres
Publié: (2013)

Stochastic well-structured transition systems
par: Aspnes, James
Publié: (2025)

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

Quantum algorithms through graph composition
par: Cornelissen, Arjan
Publié: (2025)

Quantum walks through generalized graph composition
par: Cornelissen, Arjan
Publié: (2025)

Insignificant Choice Polynomial Time: A Logic Capturing PTIME
par: Schewe, Klaus-Dieter
Publié: (2020)

A correspondence between the time and space complexity
par: Latkin, Ivan V.
Publié: (2023)

The Polynomial Hierarchy does not collapse
par: Czerwinski, Reiner
Publié: (2024)

Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers
par: Hakoniemi, Tuomas, et autres
Publié: (2024)

Which graph motif parameters count?
par: Bläser, Markus, et autres
Publié: (2025)

Functional Closure Properties of Finite $\mathbb{N}$-weighted Automata
par: Dörfler, Julian, et autres
Publié: (2024)