Vendeur : Phatpocket Limited, Waltham Abbey, HERTS, Royaume-Uni
EUR 54,42
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : 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.
EUR 68,27
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : 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.
EUR 68,81
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Vendeur : Fireside Bookshop, Stroud, GLOS, Royaume-Uni
Membre d'association : PBFA
EUR 54,42
Quantité disponible : 1 disponible(s)
Ajouter au panierCloth. Etat : Very Good. Type: Book Small plain label inside cover.
Vendeur : Antiquariat Renner OHG, Albstadt, Allemagne
Membre d'association : BOEV
EUR 35
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Sehr gut. Boston, Birkhäuser 1991. gr.8°. VII, 309 p. Hardbound. Progress in Theoretical Computer Science.- Name on flyleaf, otherwise like new.
EUR 84,63
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : Used.
EUR 83,88
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : Used.
EUR 84,67
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : Used.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 94,88
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
EUR 79,10
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 128,24
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 324.
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
EUR 118,95
Quantité disponible : 15 disponible(s)
Ajouter au panierEtat : New. 2012. Softcover reprint of the original 1st ed. 1991. paperback. . . . . .
EUR 150,35
Quantité disponible : 15 disponible(s)
Ajouter au panierEtat : New. 2012. Softcover reprint of the original 1st ed. 1991. paperback. . . . . . Books ship from the US and Ireland.
Langue: anglais
Edité par Birkhäuser Boston, Birkhäuser Boston, 2012
ISBN 10 : 1468468049 ISBN 13 : 9781468468045
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 98,04
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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.
Vendeur : BennettBooksLtd, Los Angeles, CA, Etats-Unis
EUR 163,55
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : New. In shrink wrap. Looks like an interesting title!
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
EUR 147,53
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Like New. Like NewLIKE NEW. book.
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
EUR 74,24
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : new. Questo è un articolo print on demand.
Langue: anglais
Edité par Birkhäuser, Birkhäuser Mär 2012, 2012
ISBN 10 : 1468468049 ISBN 13 : 9781468468045
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 90,94
Quantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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.
Langue: anglais
Edité par Springer-Verlag New York Inc., 2012
ISBN 10 : 1468468049 ISBN 13 : 9781468468045
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
EUR 110,22
Quantité disponible : Plus de 20 disponibles
Ajouter au panierPaperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 133,07
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. Print on Demand pp. 324 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 133,12
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. PRINT ON DEMAND pp. 324.
Langue: anglais
Edité par Birkhäuser, Birkhäuser Mär 2012, 2012
ISBN 10 : 1468468049 ISBN 13 : 9781468468045
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
EUR 90,94
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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 Nature c/o IBS, Benzstrasse 21, 48619 Heek 324 pp. Englisch.