ISBN: 9783642059148 - complexity theory: exploring the limits of efficient algorithms (15 resultados)

Condición: New.

Condición: New. In English.

Condición: New.

Condición: New. pp. 322.

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

Taschenbuch. Condición: 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. …

Condición: As New. Unread book in perfect condition.

Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condición: As New. Unread book in perfect condition.

Condición: new. Questo è un articolo print on demand.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - 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. 320 pp. Englisch.…

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

Condición: 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.

Condición: New. PRINT ON DEMAND pp. 322.

Taschenbuch. Condición: 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 320 pp. Englisch.…