Courses – Fakultet tehničkih nauka u Novom Sadu

Subject: Computational complexity theory (17.DOM46L)

Type of studies	Title
Doctoral Academic Studies	Mathematics in Engineering (Year: 1, Semester: Summer)

General information:

Category	Scientific-professional
Scientific or art field	Applied Computer Science and Informatics Teorijska i primenjena matematika
ECTS	10

Obtaining fundamental knowledge in complexity theory. Students involvement in scientific research.

Knowledge about fundamental notions and results in complexity theory. Ability to employ these methods in research, based on student`s interests and in cooperation with researchers from the region and abroad.

Computational complexity of O-notation. Abstract computational complexity. Classes of computational complexity, classes hierarchy. Open problem in the complexity classes hierarchy, P-NO problem. Complete problems. Probabilistic classes of complexity. Application of complexity theory in cryptology.

The presentation of the theoretical part during the lectures is followed by the characteristic examples which contribute to better understanding of the subject content. The students are expected to individually study the additional literature which they discuss with the lecturer at the consultation classes. Through research and study work the student will, on the bases of scientific journals and other relevant literature that has been studied independently, develop further understanding of the material covered in lectures. Working with the course lecturer the student develops the ability to independently work on a scientific paper.

Authors	Title	Year	Publisher	Language
C. Papadimitriou	Computational complexity	1995	Addison-Wesley	English
H. Lewis, C. Papadimitriou	Elements of the theory of computation	1981	Prentice-Hall	English
Sipser, M.	Introduction to the Theory of Computation	2006	Thomson Course Technology, Boston	English