Saved in:
| Main Author: | Gaysin, Azza |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.00396 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Proof complexity of universal algebra in a CSP dichotomy proof
by: Gaysin, Azza
Published: (2024)
by: Gaysin, Azza
Published: (2024)
Proof complexity of positive branching programs
by: Das, Anupam, et al.
Published: (2021)
by: Das, Anupam, et al.
Published: (2021)
Modular Counting CSP: Reductions and Algorithms
by: Kazeminia, Amirhossein, et al.
Published: (2025)
by: Kazeminia, Amirhossein, et al.
Published: (2025)
Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras
by: Barto, Libor, et al.
Published: (2021)
by: Barto, Libor, et al.
Published: (2021)
The Proof Analysis Problem
by: Arteche, Noel, et al.
Published: (2025)
by: Arteche, Noel, et al.
Published: (2025)
The Richness of CSP Non-redundancy
by: Brakensiek, Joshua, et al.
Published: (2025)
by: Brakensiek, Joshua, et al.
Published: (2025)
Proof Complexity of Linear Logics
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)
Proof Complexity and Feasible Interpolation
by: Tabatabai, Amirhossein Akbar
Published: (2025)
by: Tabatabai, Amirhossein Akbar
Published: (2025)
A simplified proof of the CSP Dichotomy Conjecture and XY-symmetric operations
by: Zhuk, Dmitriy
Published: (2024)
by: Zhuk, Dmitriy
Published: (2024)
Symmetric Proofs in the Ideal Proof System
by: Dawar, Anuj, et al.
Published: (2025)
by: Dawar, Anuj, et al.
Published: (2025)
Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
by: Atserias, Albert, et al.
Published: (2024)
by: Atserias, Albert, et al.
Published: (2024)
The CSP Dichotomy, the Axiom of Choice, and Cyclic Polymorphisms
by: Kátay, Tamás, et al.
Published: (2023)
by: Kátay, Tamás, et al.
Published: (2023)
New Bounds for the Ideal Proof System in Positive Characteristic
by: Behera, Amik Raj, et al.
Published: (2025)
by: Behera, Amik Raj, et al.
Published: (2025)
On $NP \cap coNP$ proof complexity generators
by: Krajicek, Jan
Published: (2025)
by: Krajicek, Jan
Published: (2025)
On the Interplay of Cube Learning and Dependency Schemes in QCDCL Proof Systems
by: Choudhury, Abhimanyu, et al.
Published: (2025)
by: Choudhury, Abhimanyu, et al.
Published: (2025)
Finding Bugs in Short Proofs: The Metamathematics of Resolution Lower Bounds
by: Li, Jiawei, et al.
Published: (2024)
by: Li, Jiawei, et al.
Published: (2024)
How to fit large complexity classes into TFNP
by: Thapen, Neil
Published: (2024)
by: Thapen, Neil
Published: (2024)
Semi-Algebraic Proof Systems for QBF
by: Beyersdorff, Olaf, et al.
Published: (2025)
by: Beyersdorff, Olaf, et al.
Published: (2025)
Classical Simulation of Quantum CSP Strategies
by: Banakh, Demian, et al.
Published: (2025)
by: Banakh, Demian, et al.
Published: (2025)
Separating complexity classes of LCL problems on grids
by: Berlow, Katalin, et al.
Published: (2025)
by: Berlow, Katalin, et al.
Published: (2025)
Non-commutative linear logic fragments with sub-context-free complexity
by: Nishimiya, Yusaku, et al.
Published: (2025)
by: Nishimiya, Yusaku, et al.
Published: (2025)
On Naturally and Weakly Mal'tsev Categories
by: Martins-Ferreira, Nelson
Published: (2025)
by: Martins-Ferreira, Nelson
Published: (2025)
A note on Mal'tsev objects
by: Clementino, M. M., et al.
Published: (2023)
by: Clementino, M. M., et al.
Published: (2023)
Mal'tsev products of varieties, I
by: Penza, Tomasz, et al.
Published: (2024)
by: Penza, Tomasz, et al.
Published: (2024)
Mal'tsev products of varieties, II
by: Penza, Tomasz, et al.
Published: (2024)
by: Penza, Tomasz, et al.
Published: (2024)
Partial Mal'tsevness and partial protomodularity
by: Bourn, Dominique
Published: (2015)
by: Bourn, Dominique
Published: (2015)
Free topological Mal'tsev algebras
by: Sipacheva, Ol'ga V., et al.
Published: (2024)
by: Sipacheva, Ol'ga V., et al.
Published: (2024)
Effective Versions of Strong Measure Zero
by: Rayman, Matthew
Published: (2025)
by: Rayman, Matthew
Published: (2025)
Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)
by: Oliveira, Igor C.
Published: (2025)
On the consistency of stronger lower bounds for NEXP
by: Thapen, Neil
Published: (2025)
by: Thapen, Neil
Published: (2025)
Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
by: Nechesov, Andrey
Published: (2024)
by: Nechesov, Andrey
Published: (2024)
An order out of nowhere: a new algorithm for infinite-domain CSPs
by: Mottet, Antoine, et al.
Published: (2023)
by: Mottet, Antoine, et al.
Published: (2023)
Parallelism and Adaptivity in Student-Teacher Witnessing
by: Ježil, Ondřej, et al.
Published: (2026)
by: Ježil, Ondřej, et al.
Published: (2026)
The complete classification for quantified equality constraints
by: Zhuk, Dmitriy, et al.
Published: (2021)
by: Zhuk, Dmitriy, et al.
Published: (2021)
$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
by: Zhuk, Dmitriy
Published: (2024)
by: Zhuk, Dmitriy
Published: (2024)
Truth Predicate of Inductive Definitions and Logical Complexity of Infinite-Descent Proofs
by: Ito, Sohei, et al.
Published: (2026)
by: Ito, Sohei, et al.
Published: (2026)
Rice-like complexity lower bounds for Boolean and uniform automata networks
by: Goubault-Larrecq, Aliénor, et al.
Published: (2024)
by: Goubault-Larrecq, Aliénor, et al.
Published: (2024)
A Proposed Characterization of p-Simulation Between Theories
by: Monroe, Hunter
Published: (2025)
by: Monroe, Hunter
Published: (2025)
Feasibility of Primality in Bounded Arithmetic
by: Jalali, Raheleh, et al.
Published: (2025)
by: Jalali, Raheleh, et al.
Published: (2025)
Structures preserved by primitive actions of $S_ω$
by: Bodirsky, Manuel, et al.
Published: (2025)
by: Bodirsky, Manuel, et al.
Published: (2025)
Similar Items
-
Proof complexity of universal algebra in a CSP dichotomy proof
by: Gaysin, Azza
Published: (2024) -
Proof complexity of positive branching programs
by: Das, Anupam, et al.
Published: (2021) -
Modular Counting CSP: Reductions and Algorithms
by: Kazeminia, Amirhossein, et al.
Published: (2025) -
Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras
by: Barto, Libor, et al.
Published: (2021) -
The Proof Analysis Problem
by: Arteche, Noel, et al.
Published: (2025)