activity
20092025
most citedMore about sparse halves in triangle-free graphs

4 citations · 5 across the 4 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2009★ 1 cited

On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution

Jakob Nordström, Alexander Razborov

In the context of proving lower bounds on proof space in k-DNF resolution, [Ben-Sasson and Nordstrom 2009] introduced the concept of minimally unsatisfiable sets of k-DNF formulas…