The author is a full professor at the Computer Science Department of Dortmund University. He is the author of 8 monographs and more than 150 journal and conference articles. He was head of the German youth competition in computer science and has obtained the university medal for excellent teaching. He is an elected member of the German Academy of Sciences and was head of the committee reviewing computer research projects in Germany.

• Algorithmic Problems & Their Complexity.- Fundamental Complexity Classes.- Reductions — Algorithmic Relationships Between Problems.- The Theory of NP-Completeness.- NP-complete and NP-equivalent Problems.- The Complexity Analysis of Problems.- The Complexity of Approximation Problems — Classical Results.- The Complexity of Black Box Problems.- Additional Complexity Classes and Relationships Between Complexity Classes.- Interactive Proofs.- The PCP Theorem and the Complexity of Approximation Problems.- Further Topics From Classical Complexity Theory.- The Complexity of Non-uniform Problems.- Communication Complexity.- The Complexity of Boolean Functions.

From the reviews: "This book should be important and useful for students of computer science as an introduction to complexity theory with an emphasis on randomized and approximation algorithms ... . It contains 16 chapters and extends from the foundations of modern complexity theory to recent developments with implications for concrete applications. ... The text is well written ... and the translation is successful." (Gerhard Lischke, Mathematical Reviews, Issue 2006 j) "Complexity theory is an extremely important and vivid field on the border of mathematics and computer science. ... Ingo Wegener certainly created an appealing, well-written book that is a definite choice for the specialists and lecturers when an undergraduate or graduate student asks for guidance into this challenging new field of mathematics." (Peter Hajnal, Acta Scientiarum Mathematicarum, Vol. 71, 2005)

The author is a full professor at the Computer Science Department of Dortmund University. He is the author of 8 monographs and more than 150 journal and conference articles. He was head of the German youth competition in computer science and has obtained the university medal for excellent teaching. He is an elected member of the German Academy of Sciences and was head of the committee reviewing computer research projects in Germany.

• Algorithmic Problems & Their Complexity.- Fundamental Complexity Classes.- Reductions — Algorithmic Relationships Between Problems.- The Theory of NP-Completeness.- NP-complete and NP-equivalent Problems.- The Complexity Analysis of Problems.- The Complexity of Approximation Problems — Classical Results.- The Complexity of Black Box Problems.- Additional Complexity Classes and Relationships Between Complexity Classes.- Interactive Proofs.- The PCP Theorem and the Complexity of Approximation Problems.- Further Topics From Classical Complexity Theory.- The Complexity of Non-uniform Problems.- Communication Complexity.- The Complexity of Boolean Functions.

From the reviews: "This book should be important and useful for students of computer science as an introduction to complexity theory with an emphasis on randomized and approximation algorithms ... . It contains 16 chapters and extends from the foundations of modern complexity theory to recent developments with implications for concrete applications. ... The text is well written ... and the translation is successful." (Gerhard Lischke, Mathematical Reviews, Issue 2006 j) "Complexity theory is an extremely important and vivid field on the border of mathematics and computer science. ... Ingo Wegener certainly created an appealing, well-written book that is a definite choice for the specialists and lecturers when an undergraduate or graduate student asks for guidance into this challenging new field of mathematics." (Peter Hajnal, Acta Scientiarum Mathematicarum, Vol. 71, 2005)

The author is a full professor at the Computer Science Department of Dortmund University. He is the author of 8 monographs and more than 150 journal and conference articles. He was head of the German youth competition in computer science and has obtained the university medal for excellent teaching. He is an elected member of the German Academy of Sciences and was head of the committee reviewing computer research projects in Germany.

• Algorithmic Problems & Their Complexity.- Fundamental Complexity Classes.- Reductions — Algorithmic Relationships Between Problems.- The Theory of NP-Completeness.- NP-complete and NP-equivalent Problems.- The Complexity Analysis of Problems.- The Complexity of Approximation Problems — Classical Results.- The Complexity of Black Box Problems.- Additional Complexity Classes and Relationships Between Complexity Classes.- Interactive Proofs.- The PCP Theorem and the Complexity of Approximation Problems.- Further Topics From Classical Complexity Theory.- The Complexity of Non-uniform Problems.- Communication Complexity.- The Complexity of Boolean Functions.

From the reviews: "This book should be important and useful for students of computer science as an introduction to complexity theory with an emphasis on randomized and approximation algorithms ... . It contains 16 chapters and extends from the foundations of modern complexity theory to recent developments with implications for concrete applications. ... The text is well written ... and the translation is successful." (Gerhard Lischke, Mathematical Reviews, Issue 2006 j) "Complexity theory is an extremely important and vivid field on the border of mathematics and computer science. ... Ingo Wegener certainly created an appealing, well-written book that is a definite choice for the specialists and lecturers when an undergraduate or graduate student asks for guidance into this challenging new field of mathematics." (Peter Hajnal, Acta Scientiarum Mathematicarum, Vol. 71, 2005)