Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 173
Number of items: 173
  • Buhrman, H. M. (1998). Two Queries. In Proceedings of the 13th IEEE Conference on Computational Complexity (pp. 13-19). (-; No. -).
  • 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., & Vitanyi, P. M. B. (1998). Kolmogorov random graphs. In Proceedings of the IEEE Conference on Compression and Complexity of sequences 1997 (pp. 78-96). (-; No. -). IEEE Comput. Soc. Press.
  • 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.
  • Buhrman, H. M. (1998). Functions computable with nonadaptive queries to NP. Theory of Computing Systems, 31(4), 77-92. https://doi.org/10.1007/s002240000079
  • Buhrman, H. M., Cleve, R., & van Dam, W. K. (1997). Quantum entanglement and communication complexity. (Technical Report quant-ph; No. 9705033). Unknown Publisher.
  • Buhrman, H. M., Cleve, R., van Dam, W. K., Hoyer, P., & Tapp, A. (1997). Multiparty quantum communication complexity. (Technical Report quant-ph; No. 9710054). Unknown Publisher.
  • Buhrman, H. M., Fortnow, L., & Thierauf, T. (1997). Nonrelativizing separations. (Technical Report; No. CS 97-11). University of Chicago.
Page 15 of 18