79 citations · 93 across the 20 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.LO2026
From Gödel incompleteness to the consistency of circuit lower bounds
Albert Atserias, Moritz Müller
We prove that the bounded arithmetic theory is consistent with EXP P/poly. More generally, we show that certain separations of from a theory imp…
cs.CC2026
Hard Clique Formulas for Resolution
Albert Atserias
We show how to convert any unsatisfiable 3-CNF formula which is sparse and exponentially hard to refute in Resolution into a negative instance of the -clique problem whose corre…