133 citations · 208 across the 7 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CC2017
Query-to-Communication Lifting for BPP
Mika Göös, Toniann Pitassi, Thomas Watson
For any -bit boolean function , we show that the randomized communication complexity of the composed function , where is an index gadget, is characterized by…
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…