Image de couverture de livre

Adversarial Barrier in Uniform Class Separation

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Rosko, Milan
Format:	Preprint
Publié:	2025
Sujets:	Logic Computational Complexity Logic in Computer Science 68Q15, 03F30, 03D20, 03F25, 03D25, F.1.0; F.2.0; F.4.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Remarks on Primitive Regulation
par: Rosko, Milan
Publié: (2026)

The Fractal Logic of Phi-adic Recursion
par: Rosko, Milan
Publié: (2025)

A Logspace Constructive Proof of L=SL
par: Buss, Sam, et autres
Publié: (2025)

Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
par: Tabatabai, Amirhossein Akbar, et autres
Publié: (2025)

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

Complexities of Well-Quasi-Ordered Substructural Logics
par: Galatos, Nikolaos, et autres
Publié: (2025)

The Aurellion Function: A Recursive Fast-Growing Hierarchy Beyond Knuth Notation
par: Vodrazka, Daniel
Publié: (2025)

A Theory for Probabilistic Polynomial-Time Reasoning
par: Chen, Lijie, et autres
Publié: (2026)

A proof complexity conjecture and the Incompleteness theorem
par: Krajicek, Jan
Publié: (2023)

On the Realizability of Prime Conjectures in Heyting Arithmetic
par: Rosko, Milan
Publié: (2025)

From Gödel incompleteness to the consistency of circuit lower bounds
par: Atserias, Albert, et autres
Publié: (2026)

Extended Nullstellensatz proof systems
par: Krajicek, Jan
Publié: (2023)

A non-speedup result for the chain-antichain principle over a weak base theory
par: Kowalik, Katarzyna W.
Publié: (2025)

Consistent ultrafinitist logic
par: Gajda, Michał J.
Publié: (2021)

The reverse mathematics of the pigeonhole hierarchy
par: Houérou, Quentin Le, et autres
Publié: (2024)

On the existence of strong proof complexity generators
par: Krajicek, Jan
Publié: (2022)

Serial Properties, Selector Proofs, and the Provability of Consistency
par: Artemov, Sergei
Publié: (2024)

Non-Compact Proofs
par: Artemov, Sergei
Publié: (2025)

Consistency formula is strictly stronger in PA than PA-consistency
par: Artemov, Sergei
Publié: (2025)

Arithmetics within the Linear Time Hierarchy
par: Pollett, Chris
Publié: (2025)

Undecidability in Relevant Logic
par: Knudstorp, Søren Brinck
Publié: (2026)

Weihrauch problems as containers
par: Pradic, Cécilia, et autres
Publié: (2025)

The cohesive and stable Ramsey theorems and proof size over a weak base theory
par: Kołodziejczyk, Leszek Aleksander, et autres
Publié: (2026)

The Uniform Functional Interpretation with Informative Types
par: Ferreira, Fernando, et autres
Publié: (2025)

Largeness notions and polytime translation for $\forall Σ^0_3$-consequences of $\mathsf{RT}^2_2$
par: Houérou, Quentin Le, et autres
Publié: (2026)

A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes
par: Bruse, Florian, et autres
Publié: (2026)

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

Punctually Standard and Nonstandard Models of Natural Numbers
par: Bazhenov, Nikolay, et autres
Publié: (2026)

The Golden Path to Guarded Monotone Strict NP
par: Barsukov, Alexey, et autres
Publié: (2023)

Semi-Algebraic Proof Systems for QBF
par: Beyersdorff, Olaf, et autres
Publié: (2025)

Linear Orders in Presburger Arithmetic
par: Pakhomov, Fedor, et autres
Publié: (2022)

The equational theory of the Weihrauch lattice with (iterated) composition
par: Pradic, Cécilia
Publié: (2024)

Herbrandized modified realizability
par: Ferreira, Gilda, et autres
Publié: (2024)

Effective bases and notions of effective second countability in computable analysis
par: Brattka, Vasco, et autres
Publié: (2025)

Possibility Semantics
par: Holliday, Wesley H.
Publié: (2024)

Exploring the abyss in Kleene's computability theory
par: Sanders, Sam
Publié: (2023)

On some computational properties of open sets
par: Normann, Dag, et autres
Publié: (2024)

Glivenko's theorems from an ecumenical perspective
par: Pereira, Luiz Carlos, et autres
Publié: (2026)

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)