Presentation Schedule II

19 Dezembro 2014, 15:12 Paulo Alexandre Carreira Mateus

The schedule for the presentations is the following:

Room 4.35 Department of Mathematics

  • January 5th
    • 14:00 - J. Rodrigues - Adabatic quantum computing
    • 15:00 - S. Chakraborty - Strengths and weaknesses of quantum computing
       
  • January 6th
    • 14:00 - L. Novo - Shor's algorithm [Postponed to 14th]
    • 15:00 - C. Vlachou - Algorithmic Complexity and entanglement [Postponed to 14th]
       
  • January 7th
    • 14:00 - M. Pezzutto - Kolmogorov complexity and information theory
       
  • January  12th
    • 14:00 - F. Casal - Algebrazation in complexity theory  
    • 15:00 - G. Ramos - Derandomizing from random strings
       
  • January  13th
    • 14:00 - B. Richter - Information theory in molecular biology
       
  • January 14th
    • 14:00 - L. Novo - Shor's algorithm
    • 15:00 - C. Vlachou - Algorithmic Complexity and entanglement

The presentations take 45 minutes plus 15 minutes of discussion.