Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 174
Number of items: 174
  • Buhrman, H. M., Fortnow, L., van Melkebeek, D., & Torenvliet, L. (2000). Separating complexity classes using autoreducibility. SIAM Journal on Computing, 29(5), 1497-1520. https://doi.org/10.1137/S0097539798334736
  • Ambainis, A., Buhrman, H. M., Gasarch, W. I., Kalayanasundaram, B., & Torenvliet, L. (2000). The communication complexity of enumeration, elimination and selection. In Proceedings 15th IEEE Conference on Computational Complexity: Florence (pp. 44-53)
  • Buhrman, H. M. (2000). Quantum computing and communication complexity. Bulletin of the European Association for Theoretical Computer Science, 70, 131-141.
  • Buhrman, H. M., Jiang, T., Li, M., & Vitanyi, P. M. B. (2000). New applications of the incompressibility method: Part II. Theoretical Computer Science, 235(1), 59-70. https://doi.org/10.1016/S0304-3975(99)00184-X
  • Buhrman, H. M., Panconesi, A., Silvestri, R., & Vitanyi, P. M. B. (2000). On the importance of having an identity or, is consensus really universal. In Distributed Computing Conference (Vol. 1914, pp. 134-148). Springer Verlag.
  • Buhrman, H. M., & Torenvliet, L. (2000). Randomness is Hard. SIAM Journal on Computing, 30(5), 1485-1501. https://doi.org/10.1137/S0097539799360148
  • Tromp, J., Buhrman, H. M., Li, M., & Vitanyi, P. M. B. (2000). Kolmogorov random graphs and the incompressibility method. SIAM Journal on Computing, 29(2), 590-599. https://doi.org/10.1137/S0097539797327805
  • Buhrman, H. M., Cleve, R., de Wolf, R. M., & Zalka, C. (1999). Bounds for small-error and zero-error quantum algorithms. In Proceedings of 40th IEEE Symposium on the Foundations of Computer Science (FOCS'99) (pp. 358-368)
  • Buhrman, H. M., & Torenvliet, L. (1999). Complicated complementations. In Proceedings 14th IEEE Conference on Computational Complexity (pp. 227-236). IEEE Computer Society Press.
  • Buhrman, H. M. (1999). A lower bound for quantum search of an ordered list. Information Processing Letters, 70(5), 205-209. https://doi.org/10.1016/S0020-0190(99)00069-1
Page 14 of 18