Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 85
Number of items: 85
  • Beals, C. R., Buhrman, H. M., Cleve, R., Mosca, M., & de Wolf, R. M. (2001). Quantum Lower Bounds by Polynomials. Journal of the Association for Computing Machinery, 48(4), 778-797. https://doi.org/10.1145/502090.502097
  • Buhrman, H. M., Dürr, C., Heiligman, M., Høyer, P., Magniez, F., Santha, M., & de Wolf, R. M. (2001). Quantum algorithms for element distinctness. In In Proceedings of 16th IEEE Conference on Computational Complexity (pp. 131-137)
  • Buhrman, H. M., & de Wolf, R. M. (2001). Communication complexity lower bounds by polynomials. In Proceedings of 16th IEEE Conference on Computational Complexity (pp. 120-130)
  • Ambainis, A., & de Wolf, R. M. (2001). Average-case quantum query complexity. Journal of Physics. A, Mathematical and General, 34(35), 6741-6754. https://doi.org/10.1088/0305-4470/34/35/302
  • Buhrman, H. M., Cleve, R., Watrous, J., & de Wolf, R. M. (2001). Quantum fingerprinting. Physical Review Letters, 87(16).
  • Halava, V., Hirvensalo, M., & de Wolf, R. (2001). Marked PCP is decidable. Theoretical Computer Science, 255(1-2), 193-204. https://doi.org/10.1016/S0304-3975(99)00163-2
  • Open Access
    de Wolf, R. M. (2001). Quantum Computing and Communication Complexity. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Ambainis, A., & de Wolf, R. M. (2000). Average-Case Quantum Query Complexity. Lecture Notes in Computer Science, 1770, 133-144.
  • de Wolf, R. M. (2000). Characterization of non-deterministic quatum query and quantum communication complexity. In Proceedings 15th IEEE Conference on Computational Complexity (pp. 271-278).
  • Ambainis, A., Mosca, M., Tapp, A., & de Wolf, R. M. (2000). Private quantum channels. In Proceedings of the 41st IEEE Foundations of Computer Science (FOCS 2000) (pp. 547-553)
Page 8 of 9