Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 150
Number of items: 150
  • 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
  • Vitanyi, P. M. B. (2000). A discipline of evolutionary programming. Theoretical Computer Science, 241(1-2), 3-23. https://doi.org/10.1016/S0304-3975(99)00263-7
  • Vitanyi, P. M. B., & Li, M. (2000). Minimum Description Length Induction, Baysianism, and Kolmogorov Complexity. IEEE Transactions on Information Theory, 46(2), 446-464. https://doi.org/10.1109/18.825807
  • Vitanyi, P. M. B. (2000). Three Approaches to the Quantitative Definition of Information in Individual Pure Quantum State. In Proceedings 15th IEEE Conference on Computational Complexity (pp. 263-270).
  • Gács, P., Tromp, J., & Vitanyi, P. M. B. (2000). Towards an algorithmic statistics. Lecture Notes in Computer Science, 1968, 41-55.
  • Jiang, T., Li, M., & Vitanyi, P. M. B. (2000). The incompressibility method. Lecture Notes in Computer Science, 1963, 36-53.
  • Vitanyi, P. M. B. (2000). The quantum computing challenge. Lecture Notes in Computer Science, 2000, 219-233.
  • Amano, K., Vitanyi, P. M. B., & Watanabe, O. (2000). On the length of the Monopolist Game. Computing, 2000(62), 41-48.
  • Open Access
    Terhal, B. M. (1999). Quantum Algorithms and Quantum Entanglement. [Thesis, fully internal, Universiteit van Amsterdam].
  • Vitanyi, P. M. B. (1998). Information distance. IEEE Transactions on Information Theory, 44(4), 1407-1423. https://doi.org/10.1109/18.681318
Page 11 of 15