Image de couverture de livre

Galois Energy Games: To Solve All Kinds of Quantitative Reachability Problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lemke, Caroline, Bisping, Benjamin
Format:	Preprint
Publié:	2025
Sujets:	Logic in Computer Science Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Network Satisfaction Problems Solved by k-Consistency
par: Bodirsky, Manuel, et autres
Publié: (2023)

The Proof Analysis Problem
par: Arteche, Noel, et autres
Publié: (2025)

The Reachability Problem for Neural-Network Control Systems
par: Schilling, Christian, et autres
Publié: (2024)

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

Solving promise equations over monoids and groups
par: Larrauri, Alberto, et autres
Publié: (2024)

Multi-Structural Games and Beyond
par: Carmosino, Marco, et autres
Publié: (2023)

Singleton algorithms for the Constraint Satisfaction Problem
par: Zhuk, Dmitriy
Publié: (2025)

On the Complexity of the Skolem Problem at Low Orders
par: Bacik, Piotr, et autres
Publié: (2025)

On the Descriptive Complexity of Vertex Deletion Problems
par: Bannach, Max, et autres
Publié: (2024)

The Descriptive Complexity of Relation Modification Problems
par: Chudigiewitsch, Florian, et autres
Publié: (2026)

Discrete Homotopy and Promise Constraint Satisfaction Problem
par: Beikmohammadi, Arash, et autres
Publié: (2025)

Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution
par: Beyersdorff, Olaf, et autres
Publié: (2021)

Reachability in Geometrically $d$-Dimensional VASS
par: Fu, Yuxi, et autres
Publié: (2025)

One Energy Game for the Spectrum between Branching Bisimilarity and Weak Trace Semantics
par: Bisping, Benjamin, et autres
Publié: (2024)

Near-Optimal Encodings of Cardinality Constraints
par: Krapivin, Andrew, et autres
Publié: (2026)

Devil's Games and $\text{Q}\mathbb{R}$: Continuous Games complete for the First-Order Theory of the Reals
par: Meijer, Lucas, et autres
Publié: (2025)

Automated Reencoding Meets Graph Theory
par: Przybocki, Benjamin, et autres
Publié: (2026)

Effective Versions of Strong Measure Zero
par: Rayman, Matthew
Publié: (2025)

Meta-Mathematics of Computational Complexity Theory
par: Oliveira, Igor C.
Publié: (2025)

On the consistency of stronger lower bounds for NEXP
par: Thapen, Neil
Publié: (2025)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
par: Nechesov, Andrey
Publié: (2024)

Proof Complexity of Linear Logics
par: Tabatabai, Amirhossein Akbar, et autres
Publié: (2026)

An order out of nowhere: a new algorithm for infinite-domain CSPs
par: Mottet, Antoine, et autres
Publié: (2023)

Proof complexity of positive branching programs
par: Das, Anupam, et autres
Publié: (2021)

Parallelism and Adaptivity in Student-Teacher Witnessing
par: Ježil, Ondřej, et autres
Publié: (2026)

The complete classification for quantified equality constraints
par: Zhuk, Dmitriy, et autres
Publié: (2021)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
par: Atserias, Albert, et autres
Publié: (2024)

Solving Satisfiability Modulo Counting for Symbolic and Statistical AI Integration With Provable Guarantees
par: Li, Jinzhao, et autres
Publié: (2023)

The Constraint Satisfaction Problem Over Multisorted Cores
par: Delic, Dejan, et autres
Publié: (2025)

Solvable Initial Value Problems Ruled by Discontinuous Ordinary Differential Equations
par: Bournez, Olivier, et autres
Publié: (2024)

Better Extension Variables in DQBF via Independence
par: Chew, Leroy, et autres
Publié: (2025)

Modular Counting CSP: Reductions and Algorithms
par: Kazeminia, Amirhossein, et autres
Publié: (2025)

On the Interplay of Cube Learning and Dependency Schemes in QCDCL Proof Systems
par: Choudhury, Abhimanyu, et autres
Publié: (2025)

Uniformity within Parameterized Circuit Classes
par: Hegeman, Steef, et autres
Publié: (2025)

Symmetric Proofs in the Ideal Proof System
par: Dawar, Anuj, et autres
Publié: (2025)

On Middle Grounds for Preference Statements
par: George, Anne-Marie, et autres
Publié: (2025)

Fagin's Theorem for Semiring Turing Machines
par: Badia, Guillermo, et autres
Publié: (2025)

Model Counting for Dependency Quantified Boolean Formulas
par: Fung, Long-Hin, et autres
Publié: (2025)

When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames
par: Krebs, Andreas, et autres
Publié: (2025)

Characterizing Small Circuit Classes from FAC^0 to FAC^1 via Discrete Ordinary Differential Equations
par: Antonelli, Melissa, et autres
Publié: (2025)