Items related to Complexity Theory: Exploring the Limits of Efficient...
Synopsis
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.
"synopsis" may belong to another edition of this title.
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.
From the Back Cover
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.
- PublisherSpringer
- Publication date2010
- ISBN 10 3642059147
- ISBN 13 9783642059148
- BindingPaperback
- LanguageEnglish
- Number of pages320
Search results for Complexity Theory: Exploring the Limits of Efficient...
Stock Image
Complexity Theory : Exploring the Limits of Efficient Algorithms
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 11878024-n
Quantity: Over 20 available
Stock Image
Complexity Theory : Exploring the Limits of Efficient Algorithms
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783642059148
Quantity: 10 available
Stock Image
Complexity Theory: Exploring the Limits of Efficient Algorithms
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783642059148_new
Quantity: Over 20 available
Seller Image
Complexity Theory
Published by
Springer Berlin Heidelberg Okt 2010, 2010
ISBN 10: 3642059147
ISBN 13: 9783642059148
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. 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 320 pp. Englisch. Seller Inventory # 9783642059148
Quantity: 2 available
Seller Image
Complexity Theory
Published by
Springer Berlin Heidelberg, 2010
ISBN 10: 3642059147
ISBN 13: 9783642059148
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
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 # 5045042
Quantity: Over 20 available
Seller Image
Complexity Theory : Exploring the Limits of Efficient Algorithms
Published by
Springer Berlin Heidelberg, 2010
ISBN 10: 3642059147
ISBN 13: 9783642059148
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. 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 # 9783642059148
Quantity: 1 available
Stock Image
Complexity Theory : Exploring the Limits of Efficient Algorithms
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 11878024-n
Quantity: Over 20 available
Stock Image
Complexity Theory
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Print on Demand pp. 322 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Seller Inventory # 5830193
Quantity: 4 available
Stock Image
Complexity Theory
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 322. Seller Inventory # 263099118
Quantity: 4 available
Seller Image
Complexity Theory
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Okt 2010, 2010
ISBN 10: 3642059147
ISBN 13: 9783642059148
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. 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 320 pp. Englisch. Seller Inventory # 9783642059148
Quantity: 2 available