This unit covers general issues of the theory of computation and algorithm design, including computability and complexity. The general principles are illustrated by designing several very efficient algorithms with applications in telecommunication networks, cryptography and other important fields. -- Course Website
Instructor: Computing staff
Prerequisites: 39cp and COMP225(P) and (DMTH237(P) or MATH237(P))