Cover Image

Finding Bugs in Short Proofs: The Metamathematics of Resolution Lower Bounds

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Jiawei, Li, Yuhao, Ren, Hanlin
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Optimal Lower Bounds for Symmetric Modular Circuits
by: Pago, Benedikt
Published: (2026)

The Proof Analysis Problem
by: Arteche, Noel, et al.
Published: (2025)

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

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

New Bounds for the Ideal Proof System in Positive Characteristic
by: Behera, Amik Raj, et al.
Published: (2025)

Symmetric Proofs in the Ideal Proof System
by: Dawar, Anuj, et al.
Published: (2025)

On the Unprovability of Circuit Size Bounds in Intuitionistic $\mathsf{S}^1_2$
by: Chen, Lijie, et al.
Published: (2024)

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

Lower bounds for set-blocked clauses proofs
by: Yolcu, Emre
Published: (2024)

Hard Clique Formulas for Resolution
by: Atserias, Albert
Published: (2026)

QBF Merge Resolution is powerful but unnatural
by: Mahajan, Meena, et al.
Published: (2022)

Graph Homomorphism, Monotone Classes and Bounded Pathwidth
by: Eagling-Vose, Tala, et al.
Published: (2024)

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

Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism
by: Berkholz, Christoph, et al.
Published: (2024)

Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman
by: de Rezende, Susanna F., et al.
Published: (2024)

A Simple Constructive Bound on Circuit Size Change Under Truth Table Perturbation
by: Krinkin, Kirill
Published: (2026)

Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials
by: Dwivedi, Prateek, et al.
Published: (2026)

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

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

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

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

Effective Versions of Strong Measure Zero
by: Rayman, Matthew
Published: (2025)

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

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

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

Proof Complexity and Feasible Interpolation
by: Tabatabai, Amirhossein Akbar
Published: (2025)

Proof complexity of Mal'tsev CSP
by: Gaysin, Azza
Published: (2025)

Semi-Algebraic Proof Systems for QBF
by: Beyersdorff, Olaf, et al.
Published: (2025)

Truth Predicate of Inductive Definitions and Logical Complexity of Infinite-Descent Proofs
by: Ito, Sohei, et al.
Published: (2026)

Hard QBFs for Merge Resolution
by: Beyersdorff, Olaf, et al.
Published: (2020)

Feasibility of Primality in Bounded Arithmetic
by: Jalali, Raheleh, et al.
Published: (2025)

On the Number of Quantifiers Needed to Define Boolean Functions
by: Carmosino, Marco, et al.
Published: (2024)

A SUBSET-SUM Characterisation of the A-Hierarchy
by: Gutleben, Jan, et al.
Published: (2024)

Parallel Play Saves Quantifiers
by: Carmosino, Marco, et al.
Published: (2024)

Finite Variable Counting Logics with Restricted Requantification
by: Raßmann, Simon, et al.
Published: (2024)

Epistemic Skills: Logical Dynamics of Knowing and Forgetting
by: Liang, Xiaolong, et al.
Published: (2024)

Specification and Automatic Verification of Computational Reductions
by: Grange, Julien, et al.
Published: (2024)

How to fit large complexity classes into TFNP
by: Thapen, Neil
Published: (2024)

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