Complexity Theory

Exploring the Limits of Efficient Algorithms

Authors: Wegener, Ingo

Buy this book

eBook $69.99
price for USA
  • ISBN 978-3-540-27477-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $89.95
price for USA
  • ISBN 978-3-540-21045-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $89.95
price for USA
  • ISBN 978-3-642-05914-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this Textbook

Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice:

New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of computer science.

The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.

About the authors

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.

Reviews

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." (Péter Hajnal, Acta Scientiarum Mathematicarum, Vol. 71, 2005)


Table of contents (3 chapters)

  • Algorithmic Problems & Their Complexity

    Pages 11-24

  • NP-complete and NP-equivalent Problems

    Pages 77-87

  • Additional Complexity Classes and Relationships Between Complexity Classes

    Pages 127-144

Buy this book

eBook $69.99
price for USA
  • ISBN 978-3-540-27477-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $89.95
price for USA
  • ISBN 978-3-540-21045-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $89.95
price for USA
  • ISBN 978-3-642-05914-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.

Services for this book

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Complexity Theory
Book Subtitle
Exploring the Limits of Efficient Algorithms
Authors
Translated by
Pruim, R.
Copyright
2005
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-27477-3
DOI
10.1007/3-540-27477-4
Hardcover ISBN
978-3-540-21045-0
Softcover ISBN
978-3-642-05914-8
Edition Number
1
Number of Pages
XII, 308
Number of Illustrations and Tables
18 b/w illustrations
Topics