Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 173
Number of items: 173
  • 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., 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.
  • 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
  • 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
  • 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., & Torenvliet, L. (1998). Complete sets and structure in subrecursive classes. Lecture Notes in Logic, (12), 45-78.
Page 14 of 18