"Babes-Bolyai" University of Cluj-Napoca
Faculty of Mathematics and Computer Science

Computation complexity
Code
Semes-
ter
Hours: C+S+L
Credits
Type
Section
MC006
8
2+2+0
10
optional
Informatică
Teaching Staff in Charge
Assoc.Prof. TRÎMBITAS Radu Tiberiu, Ph.D., tradu@cs.ubbcluj.ro
Aims
To introduce students in basics of Computation Complexity, to allow them analize and chose algorithms and to make them aware of limits of computability.
References
1. Knuth, D.E., Tratat de programarea calculatoarelor. Vol.I, Algoritmi fundamentali, Ed. Tehnica, Bucuresti, 1974. Vol.II, Algoritmi seminumerici. Vol.III, Sortare si cautare, Ed. Tehnica, Bucurest, 1976.
2. Wilf, H.S., Algorithmes et complexite, Mason & Prentice Hall, 1985.
3. Baase, S., Computer Algorithms: Introduction to Design and Analysis, Addison- Wesley, 1983.
4. Aho, A.V., Hopcroft, J.E., Ullmann, J.D., The Design and Analysis of Computer Algorithms, Addison Wesley, 1974.
5. Comer, Leiserson, Rivest - Algorithms, MIT Press,1990.
Assessment
Exam.