Anbieter: Phatpocket Limited, Waltham Abbey, HERTS, Vereinigtes Königreich
EUR 54,10
Anzahl: 1 verfügbar
In den WarenkorbZustand: 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.
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Anbieter: Fireside Bookshop, Stroud, GLOS, Vereinigtes Königreich
Verbandsmitglied: PBFA
EUR 54,10
Anzahl: 1 verfügbar
In den WarenkorbCloth. Zustand: Very Good. Type: Book Small plain label inside cover.
Anbieter: Antiquariat Renner OHG, Albstadt, Deutschland
Verbandsmitglied: BOEV
Hardcover. Zustand: Sehr gut. Boston, Birkhäuser 1991. gr.8°. VII, 309 p. Hardbound. Progress in Theoretical Computer Science.- Name on flyleaf, otherwise like new.
EUR 78,43
Anzahl: 1 verfügbar
In den WarenkorbZustand: Used.
Zustand: Used.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 94,32
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
EUR 79,10
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Zustand: New. 2012. Softcover reprint of the original 1st ed. 1991. paperback. . . . . . Books ship from the US and Ireland.
Sprache: Englisch
Verlag: Birkhäuser Boston, Birkhäuser Boston, 2012
ISBN 10: 1468468049 ISBN 13: 9781468468045
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Starting with Cook's pioneering work on NP-completeness in 1970, polynomial complexity theory, the study of polynomial-time com putability, has quickly emerged as the new foundation of algorithms. On the one hand, it bridges the gap between the abstract approach of recursive function theory and the concrete approach of analysis of algorithms. It extends the notions and tools of the theory of computability to provide a solid theoretical foundation for the study of computational complexity of practical problems. In addition, the theoretical studies of the notion of polynomial-time tractability some times also yield interesting new practical algorithms. A typical exam ple is the application of the ellipsoid algorithm to combinatorial op timization problems (see, for example, Lovasz [1986]). On the other hand, it has a strong influence on many different branches of mathe matics, including combinatorial optimization, graph theory, number theory and cryptography. As a consequence, many researchers have begun to re-examine various branches of classical mathematics from the complexity point of view. For a given nonconstructive existence theorem in classical mathematics, one would like to find a construc tive proof which admits a polynomial-time algorithm for the solution. One of the examples is the recent work on algorithmic theory of per mutation groups. In the area of numerical computation, there are also two tradi tionally independent approaches: recursive analysis and numerical analysis.