:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Buss, Sam, Yolcu, Emre
Format:	Preprint
Publié:	2024
Sujets:	Logic in Computer Science Computational Complexity
Accès en ligne:	https://arxiv.org/abs/2402.15871
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Lower bounds for set-blocked clauses proofs
par: Yolcu, Emre
Publié: (2024)

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)

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)

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)

Reasoning About Knowledge on Regular Expressions is 2EXPTIME-complete
par: Ghosh, Avijeet, et autres
Publié: (2025)

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)

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

Measuring robustness of dynamical systems. Relating time and space to length and precision
par: Blanc, Manon, et autres
Publié: (2023)

On the Number of Quantifiers Needed to Define Boolean Functions
par: Carmosino, Marco, et autres
Publié: (2024)

On the Unprovability of Circuit Size Bounds in Intuitionistic $\mathsf{S}^1_2$
par: Chen, Lijie, et autres
Publié: (2024)

Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman
par: de Rezende, Susanna F., et autres
Publié: (2024)

A SUBSET-SUM Characterisation of the A-Hierarchy
par: Gutleben, Jan, et autres
Publié: (2024)

Graph Homomorphism, Monotone Classes and Bounded Pathwidth
par: Eagling-Vose, Tala, et autres
Publié: (2024)

Parallel Play Saves Quantifiers
par: Carmosino, Marco, et autres
Publié: (2024)

Finite Variable Counting Logics with Restricted Requantification
par: Raßmann, Simon, et autres
Publié: (2024)

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

Specification and Automatic Verification of Computational Reductions
par: Grange, Julien, et autres
Publié: (2024)

How to fit large complexity classes into TFNP
par: Thapen, Neil
Publié: (2024)

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

A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
par: Baillot, Patrick, et autres
Publié: (2024)

Finding Bugs in Short Proofs: The Metamathematics of Resolution Lower Bounds
par: Li, Jiawei, et autres
Publié: (2024)

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

Query maintenance under batch changes with small-depth circuits
par: Datta, Samir, et autres
Publié: (2024)

Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism
par: Berkholz, Christoph, et autres
Publié: (2024)

The Existential Theory of the Reals with Summation Operators
par: Bläser, Markus, et autres
Publié: (2024)

Galois Energy Games: To Solve All Kinds of Quantitative Reachability Problems
par: Lemke, Caroline, et autres
Publié: (2025)

Complexity classification of counting graph homomorphisms modulo a prime number
par: Bulatov, Andrei A., et autres
Publié: (2021)

Hardness of monadic second-order formulae over succinct graphs
par: Gamard, Guilhem, et autres
Publié: (2023)

Hard Clique Formulas for Resolution
par: Atserias, Albert
Publié: (2026)