7 citations · 11 across the 16 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2017
Stabbing Planes
Paul Beame, Noah Fleming, Russell Impagliazzo +4
We develop a new semi-algebraic proof system called Stabbing Planes which formalizes modern branch-and-cut algorithms for integer programming and is in the style of DPLL-based mode…
cs.CC2017★ 2 cited
Random CNFs are Hard for Cutting Planes
Noah Fleming, Denis Pankratov, Toniann Pitassi +1
The random k-SAT model is the most important and well-studied distribution over k-SAT instances. It is closely connected to statistical physics; it is used as a testbench for satis…
cs.CC2010★ 7 cited
Variations on the Sensitivity Conjecture
Pooya Hatami, Raghav Kulkarni, Denis Pankratov
We present a selection of known as well as new variants of the Sensitivity Conjecture and point out some weaker versions that are also open.