New parallel algorithm for the Proof Analysis Problem
Researchers developed a way to extract satisfying assignments using low-depth circuit classes.
A parallel algorithm was created for the Proof Analysis Problem of Arteche, Atserias, de Rezende, and Khaniki (FOCS 2025). This problem involves a CNF formula on variables and a proof of a size- Resolution lower bound.
The algorithm extracts a satisfying assignment for when one exists. It uses polynomial-size circuits and quasipolynomial-size circuits. and are low-depth circuit classes.
The work uses a new formalization of the Atserias-Müller lower bound in the relativized theory . This theory corresponds to depth-4 Frege systems. This approach provides quasipolynomial-size -Frege proofs for many Resolution lower bounds.
The researchers show the Proof Analysis Problem for -Frege is -hard under quasipolynomial-time reductions. This rules out certain Atserias-Müller-type approaches to the hardness of automating constant-depth Frege. Automating -Frege on Resolution lower bound formulas suffices to automate it on all formulas.
Key facts
- The algorithm performs assignment extraction in low-depth circuit classes.
- The method works for Resolution lower bounds for all , including .
- The Proof Analysis Problem for -Frege is -hard under quasipolynomial-time reductions.