[Colloquium] Jakob Nordstrom Talk

[Donna Brooms]

*Theory Seminar Reminder*
 Note non-standard day, day and time

 
Friday, May 9, 2014
10:30 a.m.
Ryerson 276
 
Jakob Nordstrom
Royal Institute of Tech., Stockholm
www.csc.kth.se/~jakobn
 
Title: “Narrow Proofs May Be Maximally Long”
 
Abstract: We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n^Omega(w). This shows that the simple counting argument that any formula refutable in width w must have a proof in size n^O(w) is essentially tight. Moreover, our lower bounds can be generalized to polynomial calculus resolution (PCR) and Sherali-Adams, implying that the corresponding size upper bounds in terms of degree and rank are tight as well. Our results do not extend all the way to Lasserre, however---the formulas we study have Lasserre proofs of constant rank and size polynomial in both n and w.

Joint work with Albert Atserias and Massimo Lauria.
 
 
 
Host: Prof. Alexander Razborov
 
 
 
 
 
 

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.cs.uchicago.edu/pipermail/colloquium/attachments/20140507/9e2924f3/attachment.htm