CS 572 Theory of Computing
|
|
Theory of computational complexity, intractability, unsolvability results. Classification of solvable problems according to their complexities. The class of NP-complete problems. Approximate, online, distributed algorithms, and some impossibility results.
Credit units: 3 ECTS Credit units: 7.5.
|
|
|
| Bilkent University Main Page |
Last regenerated automatically on August 28, 2008 by OAC - Online Academic Catalog Software.
|
|
