碍辞尘辫濒别虫颈迟盲迟蝉迟丑别辞谤颈别
Literatur
- S. Arora und B. Barak, Computational Complexity: A Modern Approach. Cambridge U. Press 2009
- L. Hemaspaandra und M. Ogihara, The Complexity Theory Companion. Springer 2002.
- J. K枚bler, U. Sch枚ning und J. Tor谩n, The Graph Isomorphism Problem. Birkhauser 1993.
- B. Moret, The Theory of Computation. Addison Wesley 1998.
- C. Papadimitriou, Computional Complexity. Addison Wesley 1994.
- U. Sch枚ning, Perlen der Theoretischen Informatik. Wissenschaftsverlag, 1995.
- M. Sipser, Introduction to the Theory of Computation. PWS Publishing Company, 1997.
- G. Wechsung, Vorlesungen zur 碍辞尘辫濒别虫颈迟盲迟蝉迟丑别辞谤颈别. Teubner 2000.
- I. Wegener, 碍辞尘辫濒别虫颈迟盲迟蝉迟丑别辞谤颈别. Springer 2003.
Dozent
Vorlesungszeiten
Dienstag 12:00 - 14:00 in O27/123
Mittwoch 10:00 - 12:00 in O27/121
脺产耻苍驳蝉濒别颈迟别谤
Prof. Dr. Jacobo Tor谩n