Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 17
Number of items: 17
  • Buhrman, H. M., Lee, T. J., & van Melkebeek, D. (2005). Language compression and pseudorandom generators. Computational Complexity, 14, 247-274.
  • Laplante, S., Lee, T. J., & Szegedy, M. (2005). The quantum adversary method and classical formula size lower bounds. In Proceedings 20th annual conference on computational complexity (pp. 76-90). IEEE.
  • Lee, T. J., & Romashchenko, A. (2005). Resource bounded symmetry of information revisited. Theoretical Computer Science, 345, 386-405. https://doi.org/10.1016/j.tcs.2005.07.017
  • Lee, T., & Romashchenko, A. (2004). On Polynomially Time Bounded Symmetry of Information. In J. Fiala, V. Koubek, & J. Kratochvíl (Eds.), Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004 : proceedings (pp. 463-475). (Lecture Notes in Computer Science; Vol. 3153). Springer. https://doi.org/10.1007/978-3-540-28629-5_35
  • Buhrman, H. M., Lee, T. J., & van Melkebeek, D. (2004). Language Compression and Pseudorandom Generators. In 19th Annual IEEE Conference on Computational Complexity
  • Lee, T. J. (2003). Arithmetical definability over finite structures. Mathematical Logic Quarterly, 49(3), 385-392. https://doi.org/10.1002/malq.200310041
  • Lee, T. J. (2002). Arithmetical Definability over Finite Structures. (Technical Reports; No. PP-2002-04). Institute for Logic, Language and Computation.
Page 2 of 2