Volume 23, Issue 2

June 2014

Selected papers from the 28th Annual IEEE Conference on Computational Complexity (CCC 2013)

6 articles in this issue

Special Issue “Conference on Computational Complexity 2013” Guest editor’s foreword
Christopher Umans
EditorialNotes 08 May 2014 Pages: 147 - 149
The correct exponent for the Gotsman–Linial Conjecture
Daniel M. Kane
OriginalPaper 13 May 2014 Pages: 151 - 175
On Uniformity and Circuit Lower Bounds
Rahul Santhanam
Ryan Williams
OriginalPaper 16 May 2014 Pages: 177 - 205
Random arithmetic formulas can be reconstructed efficiently
Ankit Gupta
Neeraj Kayal
Youming Qiao
OriginalPaper 24 May 2014 Pages: 207 - 303
How Low can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?
Andris Ambainis
Ronald de Wolf
OriginalPaper 09 May 2014 Pages: 305 - 322
On the Power of Non-adaptive Learning Graphs
Aleksandrs Belovs
Ansis Rosmanis
OriginalPaper 13 May 2014 Pages: 323 - 354

Search