Volume 22, Issue 2

June 2013

Selected papers from the 27th Annual IEEE Conference on Computational Complexity (CCC 2012)

8 articles in this issue

Special Issue “Conference on Computational Complexity 2012” Guest editors’ foreword
Boaz Barak
Irit Dinur
EditorialNotes 07 May 2013 Pages: 215 - 217
On sunflowers and matrix multiplication
Noga Alon
Amir Shpilka
Christopher Umans
OriginalPaper 12 March 2013 Pages: 219 - 243
A satisfiability algorithm and average-case hardness for formulas over the full binary basis
Kazuhisa Seto
Suguru Tamaki
OriginalPaper 04 May 2013 Pages: 245 - 274
DNF sparsification and a faster deterministic counting algorithm
Parikshit Gopalan
Raghu Meka
Omer Reingold
OriginalPaper 07 May 2013 Pages: 275 - 310
Amplifying circuit lower bounds against polynomial time, with applications
Richard J. Lipton
Ryan Williams
OriginalPaper 04 May 2013 Pages: 311 - 343
Is Valiant–Vazirani’s isolation probability improvable?
Holger Dell
Valentine Kabanets
Osamu Watanabe
OriginalPaper 16 March 2013 Pages: 345 - 383
Parallel Approximation of Min-Max Problems
Gus Gutoski
Xiaodi Wu
OriginalPaper 03 May 2013 Pages: 385 - 428
A strong direct product theorem for quantum query complexity
Troy Lee
Jérémie Roland
OriginalPaper 30 April 2013 Pages: 429 - 462

Search