Author of the publication

Robust Polynomials and Quantum Algorithms.

, , , and . STACS, volume 3404 of Lecture Notes in Computer Science, page 593-604. Springer, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Algorithmic Clustering of Music Based on String Compression., , and . Computer Music Journal, 28 (4): 49-67 (2004)Lower Bounds for Quantum Search and Derandomization, and . CoRR, (1998)The non-adaptive query complexity of testing k-parities, , , and . CoRR, (2012)Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds, , , , and . CoRR, (2011)A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs., , and . STOC, page 618-633. ACM, (2006)Quantum lower bounds by polynomials., , , , and . J. ACM, 48 (4): 778-797 (2001)A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs., , and . Algorithmica, 55 (3): 422-461 (2009)Bell Inequalities: What Do We Know about Them and Why Should Cryptographers Care? - (Invited Talk).. ICITS, volume 6673 of Lecture Notes in Computer Science, page 117-119. Springer, (2011)Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds., , , , and . STOC, page 95-106. ACM, (2012)Quantum Search on Bounded-Error Inputs., , and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 291-299. Springer, (2003)