Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 174
Number of items: 174
  • 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)
  • Vitanyi, P. M. B., Buhrman, H. M., & Tromp, J. A. H. (2001). Time and space bounds for reversible simulation. In Proc. ICALP 2001, Lecture Notes in Computer Science (pp. 1017-1027). Springer Verlag.
  • Newman, I., Buhrman, H. M., Fortnow, L., & Röhrig, H. (2001). Quantum property testing. (Technical Report; No. 2001-080). Instituut voor Taal en Communicatie.
  • Buhrman, H. M., Cleve, R., Watrous, J., & de Wolf, R. M. (2001). Quantum fingerprinting. Physical Review Letters, 87(16).
  • Buhrman, H. M., Fenner, S., Fortnow, L., & Torenvliet, L. (2001). Two oracles that force a big crunch. Computational Complexity, 10(16), 93-116. https://doi.org/10.1007/s00037-001-8190-2
  • Buhrman, H. M., Tromp, J. A. H., & Vitanyi, P. M. B. (2001). Time and space bounds for reversible simulation. Journal of Physics. A, Mathematical and General, 34, 6821-6830. https://doi.org/10.1088/0305-4470/34/35/308
  • Open Access
    de Wolf, R. M. (2001). Quantum Computing and Communication Complexity. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Buhrman, H. M., Laplante, S., & Bro Miltersen, P. (2000). New bounds for the language compression problem. In Proceedings 15th IEEE Conference on Computational Complexity
  • Buhrman, H. M., Bro Miltersen, P., Radhakrishnan, J., & Venkatesch, S. (2000). Are bitvectors optimal? In Proceedings of Symposium on Theory of Computing (pp. 449-458)
  • Buhrman, H. M., Fenner, S., Fortnow, L., & van Melkebeek, D. (2000). Optimal Proof Sysytems and Sparse Sets. Lecture Notes in Computer Science, 407-418.
Page 13 of 18