CmpE 595 Sp. Top. in CmpE: Complexity Theory 2016 Spring


Course Schedule: 

MMM 234 BM A3

Course Program: 


Complexity theory is the mathematics of practical computer science. Some problems have algorithms for solving them. But only some of these algorithms can be implemented using a sensible amount of resources. Which ones and why? We will try to understand this.


Michael Sipser. Introduction to the Theory of Computation2nd edition. Course Technology, 2005.


Cem Say



CmpE 350 or equivalent (Talk to the instructor if you have taken CmpE 415 already.)


1.      Time Complexity

2.      Space Complexity

3.    Randomized Computation

4.    Circuit Complexity


Michael Sipser. Introduction to the Theory of Computation. 2nd edition or later.

Contact us

Department of Computer Engineering, Boğaziçi University,
34342 Bebek, Istanbul, Turkey

  • Phone: +90 212 359 45 23/24
  • Fax: +90 212 2872461

Connect with us

We're on Social Networks. Follow us & get in touch.