388 search results - page 11 / 78 » Quantum Lower Bounds by Polynomials |
STOC
2010
ACM
14 years 4 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...
TOC
2008
13 years 6 months ago
2008
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
ICALP
2005
Springer
14 years 7 days ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
CSR
2009
Springer
14 years 1 months ago
2009
Springer
STOC
2003
ACM
13 years 12 months ago
2003
ACM
