Da: Fox & Hedgehog, Moraga, CA, U.S.A.
Softcover. Condizione: Very Good+. With 31 figures (illustratore). A nice copy with tight binding and square, uncreased spine. No marks. Minor cover wear.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 89,69
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: California Books, Miami, FL, U.S.A.
EUR 92,06
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 82,79
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Chiron Media, Wallingford, Regno Unito
EUR 81,73
Quantità: 10 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 82,78
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2010
ISBN 10: 3642059147 ISBN 13: 9783642059148
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 80,24
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. 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.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Okt 2010, 2010
ISBN 10: 3642059147 ISBN 13: 9783642059148
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 80,24
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. 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 320 pp. Englisch.
EUR 71,20
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Complexity Theory | Exploring the Limits of Efficient Algorithms | Ingo Wegener | Taschenbuch | xii | Englisch | 2010 | Springer | EAN 9783642059148 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 143,87
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 134,37
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 167,03
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 66,23
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new. Questo è un articolo print on demand.
Lingua: Inglese
Editore: Springer Berlin Heidelberg Okt 2010, 2010
ISBN 10: 3642059147 ISBN 13: 9783642059148
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 80,24
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. 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 320 pp. Englisch.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2010
ISBN 10: 3642059147 ISBN 13: 9783642059148
Da: moluna, Greven, Germania
EUR 68,62
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: 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.