8 May - 14 May

Εισαγωγή - Διαδικαστικά

• Σ. Ζάχος: Hierarchies of Complexity Classes
  
  
• Α. Αντωνόπουλος: Uniform Derandomization of Complexity Classes
  
  Χρήσιμο Υλικό:
  
  • Luca Trevisan, Pseudorandomness and Combinatorial Constructions, CoRR abs/cs/0601100, 2006
  • Oded Goldreich, Lecture Notes on Pseudorandomness - Part I (polynomial-time generators), 2000
  • L. Trevisan, Lecture Notes on Pseudorandomness - Part II (derandomization), 2000.
  • N. Nisan, A. Wigderson, Hardness vs Randomness, J. Comput. Syst. Sci., 49(2):149-167, 1994
  • V. Kabanets, Derandomization: A Brief Overview, Bulletin of the European Association for Theoretical Computer Science, Number 76, pages 88-103, 2002