Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 14
Number of items: 14
  • Christensen, P. R., Kanovei, V. G., Terwijn, S. A., & Zambella, D. (1996). On the complexity of finitely additive measures. (Research report; No. S 10). University of Copenhagen.
  • Open Access
    Ambos-Spies, K., Neis, H. C., & Terwijn, S. A. (1996). Genericity and measure for exponential time. Theoretical Computer Science, 168(1), 3-19. https://doi.org/10.1016/0304-3975(96)89424-2
  • Ambos-Spies, K., Terwijn, S. A., & Zheng, X. (1994). Resource bounded randomness and weakly complete problems. In X. S. Zhang, & D. Z. Du (Eds.), Algorithms and Computation (pp. 369-377). (Lecture Notes in Computer Science; No. 834). Springer Verlag.
  • Ambos-Spies, K., Neis, H. C., & Terwijn, S. A. (1994). Genericity and measure for exponential time. In B. Rovan, I. Privara, & P. Ruzicka (Eds.), Mathematical Foundations of Computer Science 1994 (pp. 221-232). (Lecture Notes in Computer Science; No. 841). Springer Verlag.
Page 2 of 2