Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits what is possible with the available resources. The results prevent the search for non-existing efficient algorithms. The theory of NP-completeness has influenced the development of all areas of computer science. New branches of complexity theory react to all new algorithmic concepts. This textbook considers randomization as a key concept. The chosen subjects have implications to concrete applications. The significance of complexity theory for today’s computer science is stressed.

About the Author

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.

"About this title" may belong to another edition of this title.

Store Description

I mainly carry imported books from South East Asia / South Asia for readers of all Age Groups.

Visit Seller's Storefront

Seller's business information

PLETOS INC
6931 51st Avenue, WOODSIDE, Woodside, NY, 11377, U.S.A.

Sale & Shipping Terms

Terms of Sale

We accept return for those books which are received damaged. Though we take appropriate care in packing to avoid such situation.

Shipping Terms

Shipping rates within U.S.A.

Shipping rates within U.S.A.
Order quantity	12 to 19 business days	12 to 14 business days
First item	US$ 3.99	US$ 6.99

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.