Cover Image

Choiceless Polynomial Space

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ferrarotti, Flavio, Schewe, Klaus-Dieter
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science 68Q15, 68Q10, 03D15
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Behavioural Theory of Reflective Algorithms II: Reflective Parallel Algorithms
by: Schewe, Klaus-Dieter, et al.
Published: (2025)

A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)

Insignificant Choice Polynomial Time: A Logic Capturing PTIME
by: Schewe, Klaus-Dieter
Published: (2020)

Some derivations among Logarithmic Space Bounded Counting Classes
by: Janaki, V., et al.
Published: (2023)

Learning Equivalence Relations on Polish Spaces
by: Rossegger, Dino, et al.
Published: (2024)

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

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

Languages given by Finite Automata over the Unary Alphabet
by: Czerwiński, Wojciech, et al.
Published: (2023)

Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness
by: Tzameret, Iddo, et al.
Published: (2023)

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

Optimal Simultaneous Byzantine Agreement, Common Knowledge and Limited Information Exchange
by: van der Meyden, Ron
Published: (2025)

Games, mobile processes, and functionss -- alternating, concurrent, and well-bracketed semantics
by: Jaber, Guilhem, et al.
Published: (2025)

Classifying different criteria for learning algebraic structures
by: Bazhenov, Nikolay, et al.
Published: (2024)

Uniformity in learning structures
by: Cipriani, Vittorio, et al.
Published: (2025)

The complexity of being monitorable
by: Camerlo, Riccardo, et al.
Published: (2026)

Unifying lower bounds for algebraic machines, semantically
by: Seiller, Thomas, et al.
Published: (2018)

A Complete Fragment of LTL(EB)
by: Ferrarotti, Flavio, et al.
Published: (2024)

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

Hyperfiniteness on Topological Ramsey Spaces
by: Bursics, Balázs, et al.
Published: (2024)

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

Understanding and Improving Automated Proof Synthesis for Interactive Theorem Provers
by: Zhang, Manqing, et al.
Published: (2026)

Arithmetics within the Linear Time Hierarchy
by: Pollett, Chris
Published: (2025)

Parametrized complexity of relations between multidimensional subshifts
by: Carrasco-Vargas, Nicanor, et al.
Published: (2025)

Polynomial Identity Testing via Evaluation of Rational Functions
by: Hu, Ivan, et al.
Published: (2022)

On the learning power of Friedman-Stanley jumps
by: Cipriani, Vittorio, et al.
Published: (2025)

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

On Chaitin's Heuristic Principle and Halting Probability
by: Salehi, Saeed
Published: (2023)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
by: Huseynzade, Rafig
Published: (2025)

There is a deep 1-generic set
by: Li, Ang
Published: (2024)

The Optimizer Quotient and the Certification Trilemma
by: Simas, Tristan
Published: (2026)

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

On the incomputability of computable dimension
by: Staiger, Ludwig
Published: (2019)

A Formalization of Abstract Rewriting in Agda
by: Arkle, Sam, et al.
Published: (2026)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
by: Bannach, Max, et al.
Published: (2025)

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

Probabilistic Computers (So Quantum Computers) Are More Rigorously Powerful Than Traditional Computers, and Derandomization
by: Lin, Tianrong
Published: (2023)

Truth-Aware Decoding: A Program-Logic Approach to Factual Language Generation
by: Alpay, Faruk, et al.
Published: (2025)

Quantum Random Self-Modifiable Computation
by: Fiske, Michael Stephen
Published: (2018)

Refutability as Recursive as Provability
by: Cattabriga, Paola
Published: (2024)

The Solver's Paradox in Formal Problem Spaces
by: Rosko, Milan
Published: (2025)