Volume 22, Issue 4 | computational complexity

Search all computational complexity articles

Volume 22, Issue 4

December 2013

Filter by

Volume:

Sort by

Date published:

New to old Old to new

3 articles in this issue

Pseudorandom generators for CC⁰[p] and the Fourier spectrum of low-degree polynomials over finite fields
Shachar Lovett
Partha Mukhopadhyay
Amir Shpilka
OriginalPaper 23 November 2012 Pages: 679 - 725
Pseudorandom generators for combinatorial checkerboards
Thomas Watson
OriginalPaper 04 February 2012 Pages: 727 - 769
Space Functions and Space Complexity of the Word Problem in Semigroups
A. Yu. Olshanskii
OriginalPaper 16 March 2013 Pages: 771 - 830