Computational Complexity
Disclaimer: By using this web page you are accepting your university and
departmental guidelines concerning plagiarism as well as your national and international laws about intellectual
property and copyrights. More info.
Note: The information provided here may not be complete, or even correct.
This page was complied a long time after the concerned course was completed. It merely aims to provide hints and help for
younger students. The author is not responsible for any mistakes or for any consequences arising from the usage of the
materials provided on this website.
Computational Theory, Complexity Theory, Turing Machines, Automata, etc...
Coursework 1 (set by Mark Herbster)
3 problems on Turing Machines (included in the scans).
Coursework 3 (set by Robin Hirsch)
Polynomial time reduction of Hamiltonian Path & similar problems etc.
(The other coursework set by Robin (i.e. coursework 2) was an online test and is not available).
Post new comment