No article text was recorded for this version.
exponential proof complexity
Version 1 of 126 papers28 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Augmenting the Power of (Partial) MaxSat Resolution with Extension
- Blog: Reducing SAT to Max2SAT
- Blog: Proven Optimally-Balanced Latin Rectangles with SAT (Short Paper)
- Blog: Learning to Rank the Initial Branching Order of SAT Solvers
- Blog: Fixed-Parameter Tractable Reductions to SAT
- Blog: A Cardinal Improvement to Pseudo-Boolean Solving
- Blog: Learning Shorter Redundant Clauses in SDCL Using MaxSAT
- Blog: DynamicSAT: Dynamic Configuration Tuning for SAT Solving
- Blog: Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden
- Blog: Encoding Redundancy for Satisfaction-Driven Clause Learning
- Blog: Generating Weighted MAX-2-SAT Instances with Frustrated Loops: an RBM Case Study
- Blog: MaxSAT Resolution With the Dual Rail Encoding
- Blog: Probabilistic Generalization of Backdoor Trees with Application to SAT
- Blog: Challenge: How IJCAI 1999 can Prove the Value of AI by Using AI
- Blog: Solving Very Hard Problems: Cube-and-Conquer, a Hybrid SAT Solving Method
- Blog: Hardness of Random Reordered Encodings of Parity for Resolution and CDCL
- Blog: Heuristics Based on Unit Propagation for Satisfiability Problems
- Blog: Hidden Gold in Random Generation of SAT Satisfiable Instances
- Blog: Bounds on BDD-Based Bucket Elimination
- Blog: Verified Certificates via SAT and Computer Algebra Systems for the Ramsey R(3, 8) and R(3, 9) Problems
- Blog: SAT Modulo Monotonic Theories
- Blog: Solving Set Constraints with Comprehensions and Bounded Quantifiers
- Blog: On the Hardness of SAT with Community Structure
- Blog: On Probabilistic Generalization of Backdoors in Boolean Satisfiability
- Blog: A Restriction of Extended Resolution for Clause Learning SAT Solvers
- Blog: Improving and Understanding the Power of Satisfaction-Driven Clause Learning
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_exponential_proof_complexity_5cbbdfe2,
title = {exponential proof complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/exponential-proof-complexity/rdr_5cbbdfe207c34f44bdd9ada6673c00ac},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_exponential_proof_complexity_5cbbdfe2_v1,
title = {exponential proof complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/exponential-proof-complexity/rdr_5cbbdfe207c34f44bdd9ada6673c00ac/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}