Spedizione gratuita per ordini superiori a 69,99 euro.

Controllare lo stato dell'ordine

Entra a far parte di una comunità di amanti dei libri di tutto il mondo e ottieni numerosi vantaggi. Crea un account gratuito

Spedizione gratuita con Packeta per un prezzo superiore a 69.99 €

Bartolini 4.49 € Punto Poste 5.49 € Punto Poste 5.49 € Punto Bartolini 3.49 € DHL 6.99 € GLS 5.99 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Spedizione gratuita per ordini superiori a 69,99 euro.

Paradigms for Fast Parallel Approximability

Name: Paradigms for Fast Parallel Approximability
Brand: Cambridge University Press
SKU: 02030664
Price: 63.39 EUR
Availability: PreOrder
Author: Josep DíazMaria SernaPaul SpirakisJacobo Torán
ISBN: 9780521431705

Josep DíazMaria SernaPaul SpirakisJacobo Torán

Lingua

Inglese

Libro Rigido

Codice Libristo: 02030664

Casa editrice Cambridge University Press, luglio 1997

Various problems in computer science are 'hard', that is NP-complete, and so not realistically compu... Descrizione completa

Codice Libristo: 02030664

155 b

In preparazione

63.39 €

In attesa di ristampa

Termine sconosciuto

30 giorni per il reso

I clienti hanno acquistato anche

Die Kreativität des Handelns Hans Joas

In brossura

22.59 €

Secret Warriors

In brossura

102.79 €

Nedráždi bráchu bosou nohou Irena Hejdová

Rigido

14.89 €

Grandes vacances du souriceau (Les) Doray malika

Leporello

15.39 €

Cahier de coloriage Jean Cocteau Jean Cocteau

Rigido

17.29 €

Príprava do škôlky Matematika Yusuke Yonezu

In brossura

5.39 €

Der Graf von Monte Christo Alexandre

In brossura

20.69 €

Docència i pràctica del dret romà Obarrio Moreno

In brossura

14.99 €

Tardes d'estiu Torres

In brossura

7.59 €

Karty andělů Melanie Missing

Carte

17.49 €

Diario de un vacío EMI YAGI

In brossura

20.99 €

CANDY - SHOU HARUSONO ART COLLECTION Harusono

In brossura

65.29 €

Lékařský slang a úsloví Antonín Doležal

Foglio

5.59 €

CreActivity Branding: Poetiche e Storia della CreAttivit? dal Rinascimento ad oggi Stefano Donno

In brossura

8.29 €

El dia que se perdio el amor / The Day Love Was Lost Javier Castillo

In brossura

12.79 €

Kto je Wilhelm? Constance Ørbeck-Nilssen

Rigido

9.39 €

TOTS ELS CONTES DEL MÓN ARO SAINZ DE LA MAZA

Rigido

24.99 €

Paratges naturals: Massís del Garraf i conques de l'Anoia, del Foix i del Gaià XAVIER BAYER

Rigido

15.19 €

Hallo Berlin, Ici Paris - Die Darstellung der Kommunikation Patrick Barth

In brossura

16.89 €

Karl der Grosse und die Mauren Robert Schneider

In brossura

16.89 €

Kommission der Vereinten Nationen fur Friedenskonsolidierung Andreas Bonner

In brossura

16.89 €

Neue Ansätze der MittelstandsForschung Joachim Merz

In brossura

42.09 €

Manfred und Elke Rotraut S. Berner

Leporello

6.99 €

Rubens im Blick. Ausgewählte Werke unter Revision Eveliina Juntunen

In brossura

24.69 €

Various problems in computer science are 'hard', that is NP-complete, and so not realistically computable; thus in order to solve them they have to be approximated. This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is a collection of techniques that can be used to provide parallel approximations for a wide range of problems (for example, flows, coverings, matchings, travelling salesman problems, graphs), but in order to make the book reasonably self-contained, the authors provide an introductory chapter containing the basic definitions and results. A final chapter deals with problems that cannot be approximated, and the book is ended by an appendix that gives a convenient summary of the problems described in the book. This is an up-to-date reference for research workers in the area of algorithms, but it can also be used for graduate courses in the subject.