Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 150
Number of items: 150
  • Chater, N., Vitanyi, P. M. B., & Steward, N. (2001). Universal generalization and universal inter-item confusability. Behavioral and Brain Sciences, 24(4), 559-660.
  • Open Access
    Vitanyi, P. M. B., Gács, P., & Tromp, J. A. H. (2001). Algorithmic statistics. IEEE Transactions on Information Theory, 47(6), 2443-2463. https://doi.org/10.1109/18.945257
  • Open Access
    Vitanyi, P. M. B. (2001). Quantum kolmogorov complexity based on classical descriptions. IEEE Transactions on Information Theory, 47(6), 2464-2479. https://doi.org/10.1109/18.945258
  • Open Access
    de Wolf, R. M. (2001). Quantum Computing and Communication Complexity. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Jiang, T., Li, M., & Vitanyi, P. M. B. (2000). Average-case analysis of algorithms using Kolgromov complexity. Journal of Computer Science and Technology, 15(5), 402-408. https://doi.org/10.1007/BF02950402
  • Amano, K., Vitanyi, P. M. B., & Watanabe, O. (2000). On the length of the Monopolist Game. Computing, 2000(62), 41-48.
  • 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.
  • Gács, P., Tromp, J., & Vitanyi, P. M. B. (2000). Towards an algorithmic statistics. Lecture Notes in Computer Science, 1968, 41-55.
  • Buhrman, H. M., Jiang, T., Li, M., & Vitanyi, P. M. B. (2000). New applications of the incompressibility method: Part II. Theoretical Computer Science, 235(1), 59-70. https://doi.org/10.1016/S0304-3975(99)00184-X
Page 10 of 15