Anbieter: ThriftBooks-Atlanta, AUSTELL, GA, USA
Hardcover. Zustand: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
Anbieter: Phatpocket Limited, Waltham Abbey, HERTS, Vereinigtes Königreich
EUR 44,64
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: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
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: 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.
Zustand: New.
Anbieter: Fireside Bookshop, Stroud, GLOS, Vereinigtes Königreich
Verbandsmitglied: PBFA
EUR 53,42
Anzahl: 1 verfügbar
In den WarenkorbCloth. Zustand: Very Good. Type: Book Small plain label inside cover.
EUR 79,68
Anzahl: 1 verfügbar
In den WarenkorbZustand: New.
Zustand: New.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 90,94
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
EUR 79,10
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Zustand: New. 2012. Softcover reprint of the original 1st ed. 1991. paperback. . . . . .
Zustand: New. 2012. Softcover reprint of the original 1st ed. 1991. paperback. . . . . . Books ship from the US and Ireland.
Taschenbuch. Zustand: Neu. Complexity Theory of Real Functions | K. Ko | Taschenbuch | x | Englisch | 2012 | Birkhäuser | EAN 9781468468045 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
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.
Anbieter: BennettBooksLtd, Los Angeles, CA, USA
Hardcover. Zustand: New. In shrink wrap. Looks like an interesting title!
Anbieter: Buchpark, Trebbin, Deutschland
EUR 113,83
Anzahl: 1 verfügbar
In den WarenkorbZustand: Sehr gut. Zustand: Sehr gut | Seiten: 309 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.
Anbieter: Brook Bookstore On Demand, Napoli, NA, Italien
EUR 74,24
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: new. Questo è un articolo print on demand.
Sprache: Englisch
Verlag: Birkhäuser, Birkhäuser Mär 2012, 2012
ISBN 10: 1468468049 ISBN 13: 9781468468045
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 324 pp. Englisch.
Sprache: Englisch
Verlag: Springer-Verlag New York Inc., 2012
ISBN 10: 1468468049 ISBN 13: 9781468468045
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
EUR 108,00
Anzahl: Mehr als 20 verfügbar
In den WarenkorbPaperback / softback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Sprache: Englisch
Verlag: Birkhäuser Boston, Birkhäuser Boston Mär 2012, 2012
ISBN 10: 1468468049 ISBN 13: 9781468468045
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 324 pp. Englisch.