Peter Høyer - Teaching

1. Peter Høyer, Fall 2012
   CPCS 511 - Introduction to Complexity Theory
   
   Time and space complexity; the classes P, LOGSPACE, PSPACE and their nondeterministic counterparts; containments and separations between complexity classes; intractability and the theory of NP-completeness; complexity theories for probabilistic algorithms and for parallel algorithms.
   Course website.
   


2. Peter Høyer, Fall 2012
   CPCS 611 - Complexity Theory
   
   Deterministic and non-deterministic time and space complexity; complexity classes and hierarchies; NP-complete problems and intractable problems; axiomatic complexity theory.
   Course website.
   


3. Peter Høyer, Fall 2011
   CPCS 519 - Introduction to Quantum Computation
   
   Quantum information, quantum algorithms including Shor's quantum factoring algorithm and Grover's quantum searching technique, quantum error correcting codes, quantum cryptography, nonlocality and quantum communication complexity, and quantum computational complexity.
   Course website.
   


4. Peter Høyer, Fall 2011
   CPCS 619 - Quantum Computation
   
   Quantum information, quantum algorithms including Shor's quantum factoring algorithm and Grover's quantum searching technique, quantum error correcting codes, quantum cryptography, nonlocality and quantum communication complexity, and quantum computational complexity.
   Course website.