ISBN: 9783540210450 - complexity theory: exploring the limits of efficient algorithms (13 risultati)

Condizione: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

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.…

hardcover. Condizione: very good. no jacket. Like new.

Condizione: New. pp. 324.

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.…

hardcover. Condizione: New. In shrink wrap. Looks like an interesting title.

Condizione: gut. 2005. Complexity Theory: Exploring the Limits of Efficient Algorithms In deutscher Sprache. pages.

Hardcover. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

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.…

Gebunden. 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. …

Condizione: New. Print on Demand pp. 324 Illus.

Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 324 pp. Englisch.…

Condizione: New. PRINT ON DEMAND pp. 324.