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
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 10,50 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envíoEUR 19,49 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envíoLibrería: Versandantiquariat Felix Mücke, Grasellenbach - Hammelbach, Alemania
hardcover. Condición: Gut. Seiten; Artikel stammt aus Nichtraucherhaushalt! AH10784 Sprache: Deutsch Gewicht in Gramm: 3. Nº de ref. del artículo: 1203116
Cantidad disponible: 1 disponibles
Librería: Phatpocket Limited, Waltham Abbey, HERTS, Reino Unido
Condición: 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. Nº de ref. del artículo: Z1-U-017-02120
Cantidad disponible: 1 disponibles
Librería: moluna, Greven, Alemania
Condición: 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. Nº de ref. del artículo: 4884984
Cantidad disponible: Más de 20 disponibles
Librería: Moe's Books, Berkeley, CA, Estados Unidos de America
hardcover. Condición: very good. no jacket. Like new. Nº de ref. del artículo: 1137603
Cantidad disponible: 1 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Buch. Condición: 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. Nº de ref. del artículo: 9783540210450
Cantidad disponible: 2 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9783540210450_new
Cantidad disponible: Más de 20 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Buch. Condición: 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. Nº de ref. del artículo: 9783540210450
Cantidad disponible: 1 disponibles
Librería: California Books, Miami, FL, Estados Unidos de America
Condición: New. Nº de ref. del artículo: I-9783540210450
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 3184883-n
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 3184883-n
Cantidad disponible: Más de 20 disponibles