Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 84
Number of items: 84
  • Open Access
    Drucker, A., & de Wolf, R. (2011). Uniform approximation by (quantum) polynomials. Quantum Information & Computation, 11(3&4), 215-225. https://arxiv.org/abs/1008.1599
  • Open Access
    Drucker, A., & de Wolf, R. (2011). Quantum proofs for classical theorems. Theory of Computing, Theory of Computing Library, Graduate Surveys(2). https://doi.org/10.4086/toc.gs.2011.002
  • Open Access
    Buhrman, H., Cleve, R., Massar, S., & de Wolf, R. (2010). Nonlocality and communication complexity. Reviews of Modern Physics, 82(1), 665-698. https://doi.org/10.1103/RevModPhys.82.665
  • Klauck, H., Špalek, R., & de Wolf, R. (2007). Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. SIAM Journal on Computing, 36(5), 1472-1493. https://doi.org/10.1137/05063235X
  • Buhrman, H. M., Vereshchagin, N. K., & de Wolf, R. M. (2007). On Computation and Communication with Small Bias. In Proceedings of the XXII Annual IEEE Conference of Computational Complexity (pp. 24-32)
  • Buhrman, H. M., Newman, I., Röhrig, H. P., & de Wolf, R. M. (2007). Robust Polynomials and Quantum Algorithms. Journal of Computer and System Sciences, 40(4), 379-395.
  • Ambainis, A., Spalek, R., & de Wolf, R. M. (2006). A New Quantum Lower Bound Method, with Applications to Direct ProductTheorems and Time-Space Tradeoffs. In Proceedings of 38th Annual ACM Symposium on Theory of Computing (STOC'06) (pp. 618-633).
  • Open Access
    Spalek, R. (2006). Quantum Algorithms, Lower Bounds, and Time-Space Tradeoffs. [Thesis, fully internal, Universiteit van Amsterdam]. ILLC.
  • Wehner, S. D. C., & de Wolf, R. M. (2005). Improved Lower Bounds for Locally Decodable Codes and Private Information. In Proceedings of ICALP
  • Ambainis, A., Spalek, R., & de Wolf, R. M. (2005). Quantum Direct Product Theorems for Symmetric Functions and Time-Space Tradeoffs. Unknown Publisher.
Page 6 of 9