Search Sciweavers | Sciweavers

388 search results - page 11 / 78

» Quantum Lower Bounds by Polynomials

click to vote

STOC
2010
ACM

174views Algorithms» more STOC 2010»

Towards Polynomial Lower Bounds for Dynamic Problems

15 years 9 months ago

Download people.csail.mit.edu

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

claim paper

Read More »

click to vote

TOC
2008

89views more TOC 2008»

Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols

14 years 11 months ago

Download www.math.ias.edu

Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....

Emanuele Viola, Avi Wigderson

claim paper

Read More »

121

click to vote

ICALP
2005
Springer

105views Programming Languages» more ICALP 2005»

Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines

15 years 5 months ago

Download pages.cs.wisc.edu

We establish the ﬁrst 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...

Scott Diehl, Dieter van Melkebeek

claim paper

Read More »

click to vote

CSR
2009
Springer

96views Theoretical Computer Science» more CSR 2009»

Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials

15 years 6 months ago