activity
20112026
most citedAlgebraic Proof Complexity: Progress, Frontiers and Challenges

1 citations · 1 across the 8 of their papers we have counts for

collaborators
Showing 2011Show all

1 paper · 1 filter

cs.CC2011

Short Propositional Refutations for Dense Random 3CNF Formulas

Sebastian Müller, Iddo Tzameret

Random 3CNF formulas constitute an important distribution for measuring the average-case behavior of propositional proof systems. Lower bounds for random 3CNF refutations in many p…