Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
EUR 36,69
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Librería: Phatpocket Limited, Waltham Abbey, HERTS, Reino Unido
EUR 53,64
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
EUR 69,93
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Librería: Basi6 International, Irving, TX, Estados Unidos de America
EUR 69,93
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
EUR 79,36
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
Librería: Antiquariat Renner OHG, Albstadt, Alemania
Miembro de asociación: BOEV
EUR 35,00
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Sehr gut. Boston, Birkhäuser 1991. gr.8°. VII, 309 p. Hardbound. Progress in Theoretical Computer Science.- Name on flyleaf, otherwise like new.
EUR 76,35
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
Librería: Fireside Bookshop, Stroud, GLOS, Reino Unido
Miembro de asociación: PBFA
EUR 53,64
Cantidad disponible: 1 disponibles
Añadir al carritoCloth. Condición: Very Good. Type: Book Small plain label inside cover.
EUR 76,88
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
EUR 93,00
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Librería: Basi6 International, Irving, TX, Estados Unidos de America
EUR 93,00
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 93,52
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 115,34
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Used. pp. 207.
EUR 117,91
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 324.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 115,36
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Used. pp. 207.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 113,97
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Used. pp. 207.
EUR 79,10
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 118,95
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. 2012. Softcover reprint of the original 1st ed. 1991. paperback. . . . . .
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 148,96
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. 2012. Softcover reprint of the original 1st ed. 1991. paperback. . . . . . Books ship from the US and Ireland.
Idioma: Inglés
Publicado por Birkhäuser Boston, Birkhäuser Boston, 2012
ISBN 10: 1468468049 ISBN 13: 9781468468045
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 98,04
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Librería: BennettBooksLtd, Los Angeles, CA, Estados Unidos de America
EUR 162,03
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: New. In shrink wrap. Looks like an interesting title!
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 145,43
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. Like NewLIKE NEW. book.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 74,24
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Idioma: Inglés
Publicado por Birkhäuser, Birkhäuser Mär 2012, 2012
ISBN 10: 1468468049 ISBN 13: 9781468468045
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 90,94
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Idioma: Inglés
Publicado por Springer-Verlag New York Inc., 2012
ISBN 10: 1468468049 ISBN 13: 9781468468045
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 108,65
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 128,38
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: 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.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 128,35
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 324.
Idioma: Inglés
Publicado por Birkhäuser, Birkhäuser Mär 2012, 2012
ISBN 10: 1468468049 ISBN 13: 9781468468045
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 90,94
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.