119 search results - page 8 / 24 » stoc 2010 |
STOC
2010
ACM
15 years 7 months ago
2010
ACM
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...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We give a new construction of pseudorandom generators from any one-way function. The construction achieves better parameters and is simpler than that given in the seminal work of ...
TCC
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We propose a semantically-secure public-key encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum pr...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
STOC
2010
ACM
15 years 7 months ago
2010
ACM
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...