Articoli correlati a Complexity Theory: Exploring the Limits of Efficient...
Sinossi
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
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Informazioni sull?autore
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.
Dalla quarta di copertina
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreSpringer Nature
- Data di pubblicazione2005
- ISBN 10 3540210458
- ISBN 13 9783540210450
- RilegaturaCopertina rigida
- LinguaInglese
- Numero di pagine308
- Contatto del produttorenon disponibile
Compra usato
Condizioni: molto buonoSeiten; Artikel stammt aus Nichtraucherhaushalt...
Visualizza questo articolo
EUR 44,22
EUR 10,50 per la spedizione da Germania a Italia
Destinazione, tempi e costiCompra nuovo
Visualizza questo articolo
EUR 72,89
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costi
Risultati della ricerca per Complexity Theory: Exploring the Limits of Efficient...
Immagini fornite dal venditore
Complexity Theory: Exploring the Limits of Efficient Algorithms
Da: Versandantiquariat Felix Mücke, Grasellenbach - Hammelbach, Germania
Valutazione del venditore 5 su 5 stelle
hardcover. Condizione: Gut. Seiten; Artikel stammt aus Nichtraucherhaushalt! AH10784 Sprache: Deutsch Gewicht in Gramm: 3. Codice articolo 1203116
Quantità: 1 disponibili
Foto dell'editore
Complexity Theory: Exploring the Limits of Efficient Algorithms
Da: Phatpocket Limited, Waltham Abbey, HERTS, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo Z1-U-017-02120
Quantità: 1 disponibili
Immagini fornite dal venditore
Complexity Theory
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 4884984
Quantità: Più di 20 disponibili
Foto dell'editore
Complexity Theory: Exploring the Limits of Efficient Algorithms
Da: Moe's Books, Berkeley, CA, U.S.A.
Valutazione del venditore 4 su 5 stelle
hardcover. Condizione: very good. no jacket. Like new. Codice articolo 1137603
Quantità: 1 disponibili
Immagini fornite dal venditore
Complexity Theory
Editore:
Springer Berlin Heidelberg Apr 2005, 2005
ISBN 10: 3540210458
ISBN 13: 9783540210450
Nuovo
Rilegato
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 9783540210450
Quantità: 2 disponibili
Immagini fornite dal venditore
Complexity Theory : Exploring the Limits of Efficient Algorithms
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 9783540210450
Quantità: 1 disponibili
Immagini fornite dal venditore
Complexity Theory
ISBN 10: 3540210458
ISBN 13: 9783540210450
Nuovo
Rilegato
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 9783540210450
Quantità: 2 disponibili
Foto dell'editore
Complexity Theory: Exploring the Limits of Efficient Algorithms
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783540210450_new
Quantità: Più di 20 disponibili
Foto dell'editore
Complexity Theory: Exploring the Limits of Efficient Algorithms
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9783540210450
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Complexity Theory : Exploring the Limits of Efficient Algorithms
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 3184883-n
Quantità: Più di 20 disponibili