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.
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. Seller Inventory # G3540210458I2N00
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: 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
Seller: 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
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: BennettBooksLtd, Los Angeles, CA, U.S.A.
hardcover. Condition: New. In shrink wrap. Looks like an interesting title! Seller Inventory # Q-3540210458
Seller: preigu, Osnabrück, Germany
Buch. Condition: Neu. Complexity Theory | Exploring the Limits of Efficient Algorithms | Ingo Wegener | Buch | Englisch | 2005 | Springer | EAN 9783540210450 | Verantwortliche Person für die EU: Springer Nature Customer Service Center GmbH, Europaplatz 3, 69115 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu Print on Demand. Seller Inventory # 102439967
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Buch. Condition: Neu. Neuware -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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 324 pp. Englisch. Seller Inventory # 9783540210450
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
Seller: Mispah books, Redhill, SURRE, United Kingdom
Hardcover. Condition: Like New. Like New. book. Seller Inventory # ERICA77335402104586
Quantity: 1 available