:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Lemke, Caroline, Bisping, Benjamin
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Logic in Computer Science Computational Complexity
Accesso online:	https://arxiv.org/abs/2505.14691
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Network Satisfaction Problems Solved by k-Consistency
di: Bodirsky, Manuel, et al.
Pubblicazione: (2023)

The Reachability Problem for Neural-Network Control Systems
di: Schilling, Christian, et al.
Pubblicazione: (2024)

The Proof Analysis Problem
di: Arteche, Noel, et al.
Pubblicazione: (2025)

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

Solving promise equations over monoids and groups
di: Larrauri, Alberto, et al.
Pubblicazione: (2024)

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

One Energy Game for the Spectrum between Branching Bisimilarity and Weak Trace Semantics
di: Bisping, Benjamin, et al.
Pubblicazione: (2024)

Singleton algorithms for the Constraint Satisfaction Problem
di: Zhuk, Dmitriy
Pubblicazione: (2025)

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

On the Descriptive Complexity of Vertex Deletion Problems
di: Bannach, Max, et al.
Pubblicazione: (2024)

The Descriptive Complexity of Relation Modification Problems
di: Chudigiewitsch, Florian, et al.
Pubblicazione: (2026)

Reachability in Geometrically $d$-Dimensional VASS
di: Fu, Yuxi, et al.
Pubblicazione: (2025)

Discrete Homotopy and Promise Constraint Satisfaction Problem
di: Beikmohammadi, Arash, et al.
Pubblicazione: (2025)

Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution
di: Beyersdorff, Olaf, et al.
Pubblicazione: (2021)

Devil's Games and $\text{Q}\mathbb{R}$: Continuous Games complete for the First-Order Theory of the Reals
di: Meijer, Lucas, et al.
Pubblicazione: (2025)

Near-Optimal Encodings of Cardinality Constraints
di: Krapivin, Andrew, et al.
Pubblicazione: (2026)

Automated Reencoding Meets Graph Theory
di: Przybocki, Benjamin, et al.
Pubblicazione: (2026)

Effective Versions of Strong Measure Zero
di: Rayman, Matthew
Pubblicazione: (2025)

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

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

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

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

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

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

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

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

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

Solving Satisfiability Modulo Counting for Symbolic and Statistical AI Integration With Provable Guarantees
di: Li, Jinzhao, et al.
Pubblicazione: (2023)

The Constraint Satisfaction Problem Over Multisorted Cores
di: Delic, Dejan, et al.
Pubblicazione: (2025)

Polynomial Logical Zonotope: A Set Representation for Reachability Analysis of Logical Systems
di: Alanwar, Amr, et al.
Pubblicazione: (2023)

Solvable Initial Value Problems Ruled by Discontinuous Ordinary Differential Equations
di: Bournez, Olivier, et al.
Pubblicazione: (2024)

Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations
di: Blanc, Manon, et al.
Pubblicazione: (2023)

On Probabilistic and Causal Reasoning with Summation Operators
di: Ibeling, Duligur, et al.
Pubblicazione: (2024)

Measuring Decidability as Related to Busy Beaver Numbers
di: Tandi, Gurpreet, et al.
Pubblicazione: (2026)

Measuring robustness of dynamical systems. Relating time and space to length and precision
di: Blanc, Manon, et al.
Pubblicazione: (2023)

Linear-Time--Branching-Time Spectroscopy Accounting for Silent Steps
di: Bisping, Benjamin, et al.
Pubblicazione: (2023)

Better Extension Variables in DQBF via Independence
di: Chew, Leroy, et al.
Pubblicazione: (2025)

Modular Counting CSP: Reductions and Algorithms
di: Kazeminia, Amirhossein, et al.
Pubblicazione: (2025)

On the Interplay of Cube Learning and Dependency Schemes in QCDCL Proof Systems
di: Choudhury, Abhimanyu, et al.
Pubblicazione: (2025)

Uniformity within Parameterized Circuit Classes
di: Hegeman, Steef, et al.
Pubblicazione: (2025)