Search results
Results: 173
Number of items: 173
-
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., Tromp, J. A. H., & Vitanyi, P. M. B. (2001). Time and space bounds for reversible simulation. Journal of Physics. A, Mathematical and General, 34, 6821-6830. https://doi.org/10.1088/0305-4470/34/35/308
-
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
-
Buhrman, H. M., & Torenvliet, L. (2000). Randomness is Hard. SIAM Journal on Computing, 30(5), 1485-1501. https://doi.org/10.1137/S0097539799360148
-
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
Page 13 of 18