Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Selected Topics in Computational Complexity II - NTIN086

Title:	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 2023
Semester:	summer
E-Credits:	4
Hours per week, examination:	summer s.:2/1, C+Ex [HT]
Capacity:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	taught
Language:	English
Teaching methods:	full-time
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
Is incompatible with:	NTIX086
Is interchangeable with:	NTIX086

Opinion survey results Examination dates SS schedule Noticeboard

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.