Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 46
Number of items: 46
  • 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., & Torenvliet, L. (2000). Randomness is Hard. SIAM Journal on Computing, 30(5), 1485-1501. https://doi.org/10.1137/S0097539799360148
  • 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., & Torenvliet, L. (1999). Complicated complementations. In Proceedings 14th IEEE Conference on Computational Complexity (pp. 227-236). IEEE Computer Society Press.
  • Torenvliet, L., & Buhrman, H. M. (1998). Splittings, Robustness and the Structure of complete sets. SIAM Journal on Computing, 2(3), 637-653.
  • Buhrman, H. M., & Torenvliet, L. (1998). Complete sets and structure in subrecursive classes. Lecture Notes in Logic, (12), 45-78.
  • Buhrman, H. M., & Torenvliet, L. (1998). Complete sets and structure in subrecursive classes. In Proceedings of the logic colloquium '96 (pp. 45-78). (-; No. -).
  • Buhrman, H. M., & Torenvliet, L. (1998). Randomness is hard. In Proceedings of the 15th symposium on theoretial aspects of computation science (pp. 249-260). (-; No. -). Springer-Verlag.
  • Buhrman, H. M., & Torenvliet, L. (1998). Randomness is hard. In Proceedings of the 1998 conference on computational complexity (pp. 249-260). (-; No. -). IEEE Computing society press.
Page 3 of 5