Subject: Randomized and Approximation Algorithms (17.DE300 )
Native organizations units: Department of Power, Electronic and Telecommunication Engineering
Study programmes of the course:
| Type of studies | Title |
|---|---|
| Doctoral Academic Studies | Power, Electronic and Telecommunication Engineering (Year: 1, Semester: Summer) |
Study of probable and approximate (randomized) algorithms in recent years has become one of the leading research topics. This course aims to review the techniques for effective use of randomization and approximate algorithms analysis as well as examples of many settings and problems.
- ability to understand the concept of deepened probable and approximate algorithms, - ability to apply these algorithms to problems in the field of doctoral dissertation topics
Aproximability (approximation algorithms, approximation and complexity, nonaproximability), Randomised computation (randomised algorithms and randomised complexity classes, Las Vegas and Monte Carlo algorithms circuit complexity, Tools and techniques for randomised computation (Chernoff bound Lovasz local lemma, Markov chains), Cryptography (one-way functions and protocols)
Lectures. Consultation. Preparation of seminar papers. Study research.
| Authors | Title | Year | Publisher | Language |
|---|---|---|---|---|
| 1993 | English | |||
| 1995 | English |
| Course activity | Pre-examination | Obligations | Number of points |
|---|---|---|---|
| Project | Yes | Yes | 30.00 |
| Oral part of the exam | No | Yes | 70.00 |
Assoc. Prof. Dautović Staniša
Associate Professor
Lectures
Faculty of Technical Sciences
© 2024. Faculty of Technical Sciences.
Contact:
Address: Trg Dositeja Obradovića 6, 21102 Novi Sad
© 2024. Faculty of Technical Sciences.