309 search results - page 2 / 62 » Communication Complexity Lower Bounds by Polynomials |
COCO
2010
Springer
13 years 6 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
CSR
2009
Springer
13 years 11 months ago
2009
Springer
