Sciweavers

99 search results - page 3 / 20
» New strong direct product results in communication complexit...
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
Experiments with a Software Component Enabling NetSolve with Direct Communications in a Non-Intrusive and Incremental Way
The paper presents a software component that enables NetSolve with direct communications between servers in a non-intrusive and incremental way. Non-intrusiveness means that the s...
Xin Zuo, Alexey L. Lastovetsky
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
14 years 8 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
13 years 11 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson
APSEC
2004
IEEE
13 years 11 months ago
A Project Management Support Tool using Communication for Agile Software Development
Recently, agile software development methods are popular because software should be developed in a short period. However, conventional project management techniques are often not ...
Noriko Hanakawa, Kimiharu Okura
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
14 years 2 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman