STOC
2010
ACM
14 years 9 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
14 years 9 months ago
2010
ACM
STOC
2010
ACM
14 years 9 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...
STOC
2010
ACM
14 years 9 months ago
2010
ACM
STOC
2010
ACM
14 years 9 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
STOC
2010
ACM
14 years 9 months ago
2010
ACM
STOC
2010
ACM
14 years 9 months ago
2010
ACM
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
STOC
2010
ACM
14 years 9 months ago
2010
ACM
In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the foll...