SubjectsSubjects(version: 845)
Course, academic year 2018/2019
   Login via CAS
Selected Topics in Computational Complexity II - NTIN086
Title in English: Vybrané kapitoly z výpočetní složitosti II
Guaranteed by: Computer Science Institute of Charles University (32-IUUK)
Faculty: Faculty of Mathematics and Physics
Actual: from 2018 to 2019
Semester: summer
E-Credits: 5
Hours per week, examination: summer s.:2/1 C+Ex [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: not taught
Language: Czech, English
Teaching methods: full-time
Note: you can enroll for the course repeatedly
Guarantor: prof. Mgr. Michal Koucký, Ph.D.
Class: Informatika Mgr. - Teoretická informatika
Classification: Informatics > Theoretical Computer Science
Annotation -
Last update: T_KTI (12.05.2006)
This course covers advanced topics in computational complexity. Each semester will be devoted to a different topic. Topics will include among others: randomness and pseudorandom generators, communication complexity and interactive protocols, error-correcting codes and their applications in complexity, lower bounds, expanders and their applications. The course is intended to students from upper classes and to graduate students. Prerequisites: understanding of elementary concepts from computational complexity, probability theory and discrete math.
Aim of the course - Czech
Last update: T_KTI (23.05.2008)

Naučit vybrané kapitoly z výpočetní složitosti

Syllabus -
Last update: T_KTI (12.05.2006)
  • Randomness and pseudorandom generators.
  • Communication complexity and interactive protocols.
  • Error-correcting codes and their applications in complexity.
  • Lower bounds.
  • Expanders and their applications.

 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html