Edukatico will keep you updated from time to time. (You can stop this at any time.)
Choose filter settings here or enter a search term above.
This course teaches its students about basic concepts in theoretical computer science – such as NP-completeness – and what they imply for solving tough algorithmic problems.
Through a combination of classic papers and more recent work, students will explore automated decision-making from a computer-science perspective. They will examine efficient...
You can change your individual cookie settings here: