Imagen de Portada

Devil's Games and $\text{Q}\mathbb{R}$: Continuous Games complete for the First-Order Theory of the Reals

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Meijer, Lucas, de Mesmay, Arnaud, Miltzow, Tillmann, Schaefer, Marcus, Stade, Jack
Formato:	Preprint
Publicado:	2025
Materias:	Computational Geometry Computational Complexity Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Representing Matroids over the Reals is $\exists \mathbb R$-complete
por: Kim, Eun Jung, et al.
Publicado: (2023)

The Existential Theory of the Reals as a Complexity Class: A Compendium
por: Schaefer, Marcus, et al.
Publicado: (2024)

Beyond Bits: An Introduction to Computation over the Reals
por: Miltzow, Tillmann
Publicado: (2026)

Multi-Structural Games and Beyond
por: Carmosino, Marco, et al.
Publicado: (2023)

The complete classification for quantified equality constraints
por: Zhuk, Dmitriy, et al.
Publicado: (2021)

Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
por: Abrahamsen, Mikkel, et al.
Publicado: (2020)

Galois Energy Games: To Solve All Kinds of Quantitative Reachability Problems
por: Lemke, Caroline, et al.
Publicado: (2025)

The Existential Theory of the Reals with Summation Operators
por: Bläser, Markus, et al.
Publicado: (2024)

Meta-Mathematics of Computational Complexity Theory
por: Oliveira, Igor C.
Publicado: (2025)

On the local consequence of modal Product logic: standard completeness and decidability
por: Vidal, Amanda
Publicado: (2023)

On Classifying Continuous Constraint Satisfaction Problems
por: Miltzow, Tillmann, et al.
Publicado: (2021)

Training Fully Connected Neural Networks is $\exists\mathbb{R}$-Complete
por: Bertschinger, Daniel, et al.
Publicado: (2022)

Oracle Separations for RPH
por: Hamm, Thekla, et al.
Publicado: (2025)

Characterizing Small Circuit Classes from FAC^0 to FAC^1 via Discrete Ordinary Differential Equations
por: Antonelli, Melissa, et al.
Publicado: (2025)

On the Complexity of the Skolem Problem at Low Orders
por: Bacik, Piotr, et al.
Publicado: (2025)

The Complexity and Expressive Power of Second-Order Extended Logic
por: Feng, Shiguang, et al.
Publicado: (2022)

Quantum First-Order Logics That Capture Logarithmic-Time/Space Quantum Computability
por: Yamakami, Tomoyuki
Publicado: (2025)

First Order Logic on Pathwidth Revisited Again
por: Lampis, Michael
Publicado: (2022)

A Proposed Characterization of p-Simulation Between Theories
por: Monroe, Hunter
Publicado: (2025)

Toward a Characterization of Simulation Between Arithmetic Theories
por: Monroe, Hunter
Publicado: (2026)

Termination of Real Linear Loops
por: Neumann, Eike, et al.
Publicado: (2026)

Automated Reencoding Meets Graph Theory
por: Przybocki, Benjamin, et al.
Publicado: (2026)

A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
por: Baillot, Patrick, et al.
Publicado: (2024)

Verifying Quantized Graph Neural Networks is PSPACE-complete
por: Sälzer, Marco, et al.
Publicado: (2025)

Proceedings Fifteenth International Symposium on Games, Automata, Logics, and Formal Verification
por: Achilleos, Antonis, et al.
Publicado: (2024)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
por: Nechesov, Andrey
Publicado: (2024)

Proof Complexity of Linear Logics
por: Tabatabai, Amirhossein Akbar, et al.
Publicado: (2026)

An order out of nowhere: a new algorithm for infinite-domain CSPs
por: Mottet, Antoine, et al.
Publicado: (2023)

The Proof Analysis Problem
por: Arteche, Noel, et al.
Publicado: (2025)

Proof complexity of positive branching programs
por: Das, Anupam, et al.
Publicado: (2021)

Parallelism and Adaptivity in Student-Teacher Witnessing
por: Ježil, Ondřej, et al.
Publicado: (2026)

Effective Versions of Strong Measure Zero
por: Rayman, Matthew
Publicado: (2025)

On the consistency of stronger lower bounds for NEXP
por: Thapen, Neil
Publicado: (2025)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
por: Atserias, Albert, et al.
Publicado: (2024)

$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
por: Zhuk, Dmitriy
Publicado: (2024)

Reasoning About Knowledge on Regular Expressions is 2EXPTIME-complete
por: Ghosh, Avijeet, et al.
Publicado: (2025)

On Equivalent Characterizations of NP in Abstract Models of Computation
por: Kirn, Jeremy C., et al.
Publicado: (2025)

A Theory of Formalisms for Representing Knowledge
por: Zhang, Heng, et al.
Publicado: (2024)

Feasibility of Primality in Bounded Arithmetic
por: Jalali, Raheleh, et al.
Publicado: (2025)

Proof complexity of Mal'tsev CSP
por: Gaysin, Azza
Publicado: (2025)