:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Raßmann, Simon, Schindling, Georg, Schweitzer, Pascal
Format:	Preprint
Publié:	2024
Sujets:	Logic in Computer Science Computational Complexity
Accès en ligne:	https://arxiv.org/abs/2411.06944
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Homomorphism Indistinguishability and Game Comonads for Restricted Conjunction and Requantification
par: Schindling, Georg
Publié: (2025)

Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
par: Pratt-Hartmann, Ian
Publié: (2006)

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

Epistemic Logic Programs: Non-Ground and Counting Complexity
par: Eiter, Thomas, et autres
Publié: (2025)

Computational complexity of the Weisfeiler-Leman dimension
par: Lichter, Moritz, et autres
Publié: (2024)

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

Aspects of Coherence in Dependence Logic
par: Barlag, Timon, et autres
Publié: (2026)

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

Logic and Computation through the Lens of Semirings
par: Barlag, Timon, et autres
Publié: (2025)

Epistemic Skills: Logical Dynamics of Knowing and Forgetting
par: Liang, Xiaolong, et autres
Publié: (2024)

Logics with probabilistic team semantics and the Boolean negation
par: Hannula, Miika, et autres
Publié: (2023)

The Complexity and Expressive Power of Second-Order Extended Logic
par: Feng, Shiguang, et autres
Publié: (2022)

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

Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
par: Pratt-Hartmann, Ian
Publié: (2008)

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

Datalog-Expressibility for Monadic and Guarded Second-Order Logic
par: Bodirsky, Manuel, et autres
Publié: (2020)

Compilation and Fast Model Counting beyond CNF
par: de Colnet, Alexis, et autres
Publié: (2025)

Restricted CSPs and F-free Digraph Algorithmics
par: Guzmán-Pro, Santiago, et autres
Publié: (2025)

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

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

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

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

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

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)

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

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

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)

Data Complexity in Expressive Description Logics With Path Expressions
par: Bednarczyk, Bartosz
Publié: (2024)

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

Spectra of Cardinality Queries over Description Logic Knowledge Bases
par: Manière, Quentin, et autres
Publié: (2024)

Minimal Model Reasoning in Description Logics: Don't Try This at Home!
par: Di Stefano, Federica, et autres
Publié: (2025)

Quantum First-Order Logics That Capture Logarithmic-Time/Space Quantum Computability
par: Yamakami, Tomoyuki
Publié: (2025)

First Order Logic on Pathwidth Revisited Again
par: Lampis, Michael
Publié: (2022)

Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
par: Seppelt, Tim
Publié: (2023)

Truth Predicate of Inductive Definitions and Logical Complexity of Infinite-Descent Proofs
par: Ito, Sohei, et autres
Publié: (2026)

On Probabilistic and Causal Reasoning with Summation Operators
par: Ibeling, Duligur, et autres
Publié: (2024)

Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations
par: Blanc, Manon, et autres
Publié: (2023)

Measuring Decidability as Related to Busy Beaver Numbers
par: Tandi, Gurpreet, et autres
Publié: (2026)