You have Guest access.
Log In
Volume 1 / 1991 - Volume 20 / 2011
147-148
Special Issue: “Conference on Computational Complexity 2007” Guest Editor’s Foreword
Peter Bro Miltersen
149-178
Halfspace Matrices
Alexander A. Sherstov
179-219
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
R. Ryan Williams
220-253
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
Marius Zimand
254-281
Basis Collapse in Holographic Algorithms
Jin-Yi Cai and Pinyan Lu
282-299
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
Richard Cleve, William Slofstra, Falk Unger and Sarvagya Upadhyay
300-351
Limits on the Hardness of Lattice Problems in ℓ p Norms
Chris Peikert
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info