1 citations · 2 across the 10 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.CC2024
Local Enumeration and Majority Lower Bounds
Mohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák +2
Depth-3 circuit lower bounds and -SAT algorithms are intimately related; the state-of-the-art -circuit lower bound and the -SAT algorithm are based on the same combina…
cs.CC2024
Bounded-Depth Frege Lower Bounds for Random 3-CNFs via Deterministic Restrictions
Svyatoslav Gryaznov, Navid Talebanfard
A major open problem in proof complexity is to demonstrate that random 3-CNFs with a linear number of clauses require super-polynomial size refutations in bounded-depth Frege syste…