Reflects recent developments in its emphasis on randomized and approximation algorithms and communication models
All topics are considered from an algorithmic point of view stressing the implications for algorithm design
"synopsis" may belong to another edition of this title.
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)
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.
£ 9.28 shipping from Germany to United Kingdom
Destination, rates & speedsSeller: Versandantiquariat Felix Mücke, Grasellenbach - Hammelbach, Germany
hardcover. Condition: Gut. Seiten; Artikel stammt aus Nichtraucherhaushalt! AH10784 Sprache: Deutsch Gewicht in Gramm: 3. Seller Inventory # 1203116
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: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 3184883-n
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9783540210450_new
Quantity: Over 20 available
Seller: Moe's Books, Berkeley, CA, U.S.A.
hardcover. Condition: very good. no jacket. Like new. Seller Inventory # 1137603
Quantity: 1 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Reflects recent developments in its emphasis on randomized and approximation algorithms and communication modelsAll topics are considered from an algorithmic point of view stressing the implications for algorithm design 324 pp. Englisch. Seller Inventory # 9783540210450
Quantity: 2 available
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Introduction into Complexity Theory with recent resultsWith complete proofs of all resultsIntegration of new parts of Complexity Theory as inapproximability, PCP theorem, interactive proof systems, communication complexity, black-box optimi. Seller Inventory # 4884984
Quantity: Over 20 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783540210450
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 3184883-n
Quantity: Over 20 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9783540210450
Quantity: Over 20 available