Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 173
Number of items: 173
  • Allender, E., Buhrman, H. M., & Koucky, M. (2006). What can be efficiently reduced to the kolmogorov-random strings? Annals of Pure and Applied Logic, 138(1-3), 2-19. https://doi.org/10.1016/j.apal.2005.06.003
  • Allender, E., Buhrman, H. M., Koucky, M., van Melkebeek, D., & Ronneburger, D. (2006). Power from random strings. SIAM Journal on Computing, 35(6), 1467-1493. https://doi.org/10.1137/050628994
  • Buhrman, H. M. (2006). Toveren met kwantum informatie. In B. Mols (Ed.), Het raadsel van informatie (pp. 95-113). (7; No. 6). Boom.
  • Buhrman, H. M., Christandl, M., Hayden, P., H.-K., L., & Wehner, S. D. C. (2006). Security of quantum bit string commitment depends on the information measure. Physical Review Letters, 97, 250501. http://www.arxiv.org/abs/quant-ph/0609237
  • Buhrman, H. M., Christandl, M., Unger, F. P., Wehner, S. D. C., & WInter, A. (2006). Implications of superstrong non-locality for cryptography. In Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Vol. 462, pp. 1919-1932)
  • Open Access
    Spalek, R. (2006). Quantum Algorithms, Lower Bounds, and Time-Space Tradeoffs. [Thesis, fully internal, Universiteit van Amsterdam]. ILLC.
  • Open Access
    Lee, T. J. (2006). Kolmogorov Complexity and formula size lower bounds. [Thesis, fully internal, Universiteit van Amsterdam]. ILLC.
  • Buhrman, H. M., & Torenvliet, L. (2005). A Post's program for complexity theory. Bulletin of the European Association for Theoretical Computer Science, 85, 41-51.
  • Buhrman, H. M., Lee, T. J., & van Melkebeek, D. (2005). Language compression and pseudorandom generators. Computational Complexity, 14, 247-274.
  • Buhrman, H. M., Dürr, C., Heiligman, M., Hoyer, P., Magniez, F., Santha, M., & de Wolf, R. M. (2005). Quantum Algorithms for Element Distinctness. SIAM Journal on Computing, 34(6), 1324-1330. https://doi.org/10.1137/S0097539702402780
Page 10 of 18