Image de couverture de livre

Hard Clique Formulas for Resolution

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Atserias, Albert
Format:	Preprint
Publié:	2026
Sujets:	Computational Complexity Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

Hard QBFs for Merge Resolution
par: Beyersdorff, Olaf, et autres
Publié: (2020)

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

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

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

QBF Merge Resolution is powerful but unnatural
par: Mahajan, Meena, et autres
Publié: (2022)

Structural Origin and the Minimal Syntax of NP-Hardness: Analysis of SAT from Syntactic Generativity and Compositional Collapse
par: Nishiyama, Yumiko
Publié: (2025)

Hard to Explain: On the Computational Hardness of In-Distribution Model Interpretation
par: Amir, Guy, et autres
Publié: (2024)

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

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

Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism
par: Berkholz, Christoph, 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)

Testing for Renamability to Classes of Clause Sets
par: Brandl, Albert, et autres
Publié: (2025)

From Gödel incompleteness to the consistency of circuit lower bounds
par: Atserias, Albert, et autres
Publié: (2026)

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

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

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

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)

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)

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

New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs
par: Brakensiek, Joshua, et autres
Publié: (2026)

Optimal Lower Bounds for Symmetric Modular Circuits
par: Pago, Benedikt
Publié: (2026)

Termination of Real Linear Loops
par: Neumann, Eike, et autres
Publié: (2026)

Extending CDCL to disjunctions of parity equations
par: Beame, Paul, et autres
Publié: (2026)

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

Dynamic Planar Graph Isomorphism is in DynFO
par: Datta, Samir, et autres
Publié: (2026)

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

Proofdoors and Efficiency of CDCL Solvers
par: Singh, Sunidhi, et autres
Publié: (2026)

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

A Simple Constructive Bound on Circuit Size Change Under Truth Table Perturbation
par: Krinkin, Kirill
Publié: (2026)

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

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

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)

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