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.
"synopsis" may belong to another edition of this title.
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.
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 this title" may belong to another edition of this title.
£ 4.82 shipping within U.S.A.
Destination, rates & speedsSeller: Moe's Books, Berkeley, CA, U.S.A.
hardcover. Condition: very good. no jacket. Like new. Seller Inventory # 1137603
Quantity: 1 available
Seller: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Hardcover. Condition: As New. No Jacket. Pages are clean and are not marred by notes or folds of any kind. ~ ThriftBooks: Read More, Spend Less 1.3. Seller Inventory # G3540210458I2N00
Quantity: 1 available
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Seller Inventory # Z1-U-017-02120
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 3184883
Quantity: Over 20 available
Seller: Best Price, Torrance, CA, U.S.A.
Condition: New. SUPER FAST SHIPPING. Seller Inventory # 9783540210450
Quantity: 2 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 3184883-n
Quantity: Over 20 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Mar3113020162823
Quantity: Over 20 available
Seller: Grand Eagle Retail, Mason, OH, U.S.A.
Hardcover. Condition: new. Hardcover. 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. A title that reflects the developments in its emphasis on randomized and approximation algorithms and communication models. In it, all topics are considered from an algorithmic point of view stressing the implications for algorithm design. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9783540210450
Quantity: 1 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9783540210450
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9783540210450_new
Quantity: Over 20 available