Sciweavers

STOC
2010
ACM
210views Algorithms» more  STOC 2010»
14 years 9 months ago
Recognizing well-parenthesized expressions in the streaming model
Frederic Magniez, Claire Mathieu and Ashwin Nayak
STOC
2010
ACM
184views Algorithms» more  STOC 2010»
14 years 9 months ago
An Invariance Principle For Polytopes
Prahladh Harsha, Adam Klivans and Raghu Meka
STOC
2010
ACM
378views Algorithms» more  STOC 2010»
14 years 9 months ago
On the Geometry of Differential Privacy
Moritz Hardt and Kunal Talwar
STOC
2010
ACM
202views Algorithms» more  STOC 2010»
14 years 9 months ago
How to Compress Interactive Communication
Boaz Barak, Mark Braverman, Xi Chen and Anup Rao
STOC
2010
ACM
244views Algorithms» more  STOC 2010»
14 years 9 months ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams
STOC
2010
ACM
174views Algorithms» more  STOC 2010»
14 years 9 months ago
Towards Polynomial Lower Bounds for Dynamic Problems
We consider a number of dynamic problems with no known poly-logarithmic upper bounds, and show that they require n(1) time per operation, unless 3SUM has strongly subquadratic alg...
Mihai Patrascu
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 9 months ago
QIP = PSPACE
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and Jo...
STOC
2010
ACM
207views Algorithms» more  STOC 2010»
14 years 9 months ago
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
Zohar S. Karnin and Partha Mukhopadhyay and Amir S...