Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2019/2020

Complexity and Combinatorical Algorithms

The course is not on the list Without time-table
Code Completion Credits Range Language
XP01KAS ZK 4 2+1 Czech
Lecturer:
Tutor:
Supervisor:
Department of Mathematics
Synopsis:

Time and space complexity of algorithms. P and NP problems and their solutions: exact solutions, heuristics, approximation schemes, probabilistic algorithm. Equivalences of problems.

Requirements:
Syllabus of lectures:
Syllabus of tutorials:
Study Objective:
Study materials:

1. G. Ausiello, P. Croscenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi: Complexity and Approximztion Combinatorial Optimization Problems and Their Approximability Properties. Springer, 1999.

2. Jozef Gruska: Foundations of Computing. International Thomson Computer Press, 1997.

Note:
Further information:
http://math.feld.cvut.cz/demlova/teaching/kas.html
No time-table has been prepared for this course
The course is a part of the following study plans:
Data valid to 2019-10-18
For updated information see http://bilakniha.cvut.cz/en/predmet11505704.html