Order Total (1 Item Items):
Shipping Destination:
Pierluigi Crescenzi (40 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (40)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (27)
- As New, Fine or Near Fine (5)
- Very Good or Good (6)
- Fair or Poor (No further results match this refinement)
- As Described (2)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (16)
- Not Print on Demand (31)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
-
Hardcover. Condition: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
-
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
-
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
-
Introduction to the Theory of Complexity (Prentice Hall International Series in Computer Science)
Seller: WorldofBooks, Goring-By-Sea, WS, United Kingdom
Seller rating 5 out of 5 stars
Hardback. Condition: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.
-
Condition: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present.
-
Introduction to the Theory of Complexity
Seller: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Germany
Seller rating 5 out of 5 stars
Hardcover. 296 p. Good condition. The pages are clean and without markings. Slight signs of storage and use. Retired library copy with corresponding markings. Spine slightly light-edged. Otherwise, a neat copy. 9780139153808 Sprache: Englisch Gewicht in Gramm: 1000.
-
Problemi, algoritmi e coding. Le magie dell'informatica
Seller: libreriauniversitaria.it, Occhiobello, RO, Italy
Seller rating 4 out of 5 stars
Condition: NEW.
-
-
Paperback or Softback. Condition: New. Algorithms and Complexity: Second Italian Conference, Ciac '94, Rome, Italy, February 23 - 25, 1994. Proceedings. Book.
-
-
2. corrected print. 524 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 9783540654315 Sprache: Englisch Gewicht in Gramm: 990.
-
US$ 31.91
US$ 13.21 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: Brand New. Italian language. 7.80x4.96x0.63 inches. In Stock.
-
US$ 64.75
US$ 20.46 shipping
Ships from United Kingdom to U.S.A.Quantity: 10 available
Add to basketPaperback. Condition: New.
-
Algorithms and Complexity: Second Italian Conference, CIAC '94, Rome, Italy, February 23 - 25, 1994. Proceedings (Lecture Notes in Computer Science, 778)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 69.10
US$ 15.82 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Algorithms and Complexity : Second Italian Conference, Ciac '94, Rome, Italy, February 23 - 25, 1994. Proceedings
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 68.12
US$ 19.81 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
paperback. Condition: As New. Come fa il motore di ricerca a trovare l'informazione che mi serve? E la pay-tv online a propormi un film che con ogni probabilità mi piace davvero? Sembra una magia, in realtà è il risultato di algoritmi che funzionano. Un algoritmo è una ricetta: istruzioni semplici, ma basta seguirle alla lettera, per fare cose ingegnose e complesse. Trovi l'informazione che cercavi o scopri il film che, senza saperlo, desideravi vedere. Ogni algoritmo nasce per risolvere un problema. La sfida degli informatici è trovare soluzioni ingegnose ed efficienti, da esprimere come algoritmi e da tradurre poi in un linguaggio di programmazione. Il coding, Ğscrivere codiceğ, vuol dire proprio questo: sapere tradurre i passi dell'algoritmo in codice, cioè nei linguaggi che i computer comprendono. E questo è il pensiero computazionale: il processo che va dalla formulazione del problema all'esecuzione del programma, attraverso la definizione dell'algoritmo. Book.
-
Strutture di dati e algoritmi. Progettazione, analisi e visualizzazione
Seller: libreriauniversitaria.it, Occhiobello, RO, Italy
Seller rating 4 out of 5 stars
Condition: NEW.
-
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 113.00
US$ 15.82 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Condition: New. pp. xx + 524.
-
Algorithms and Complexity : Second Italian Conference, CIAC '94, Rome, Italy, February 23 - 25, 1994. Proceedings
Language: English
Published by Springer Berlin Heidelberg, 1994
ISBN 10: 3540578110 ISBN 13: 9783540578116
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The papers in this volume were presented at the SecondItalian Conference onAlgorithms and Complexity, held inFebruary 1994 in Rome. This biannual conference series isintended to present research contributions in theory andapplications of sequential, parallel, and distributedalgorithms, data structures, and computational complexity.The volume contains four invited presentations and 14regular presentations selected from 32 submissions, each ofwhich was evaluated by at least four program committeemembers. The invited presentations are by J. Hartmanis andS. Chari, A. Garg and R. Tamassia, S.C. Sahinalp and U.Vishkin, and M. Yannakakis.
-
Taschenbuch. Condition: Neu. Algorithms and Complexity | Second Italian Conference, CIAC '94, Rome, Italy, February 23 - 25, 1994. Proceedings | Maurizio Bonuccelli (u. a.) | Taschenbuch | ix | Englisch | 1994 | Springer | EAN 9783540578116 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
US$ 137.97
US$ 16.51 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: Brand New. 548 pages. 9.50x7.10x1.00 inches. In Stock.
-
Algorithms and Complexity : Second Italian Conference, Ciac '94, Rome, Italy, February 23 - 25, 1994. Proceedings
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 136.02
US$ 19.81 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Condition: New. pp. xx + 524 2nd Corrected Printing.
-
US$ 125.15
US$ 33.02 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Condition: As New. Unread book in perfect condition.
-
US$ 144.19
US$ 33.02 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Hardcover. Condition: New.
-
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - N COMPUTER applications we are used to live with approximation. Var I ious notions of approximation appear, in fact, in many circumstances. One notable example is the type of approximation that arises in numer ical analysis or in computational geometry from the fact that we cannot perform computations with arbitrary precision and we have to truncate the representation of real numbers. In other cases, we use to approximate com plex mathematical objects by simpler ones: for example, we sometimes represent non-linear functions by means of piecewise linear ones. The need to solve difficult optimization problems is another reason that forces us to deal with approximation. In particular, when a problem is computationally hard (i. e. , the only way we know to solve it is by making use of an algorithm that runs in exponential time), it may be practically unfeasible to try to compute the exact solution, because it might require months or years of machine time, even with the help of powerful parallel computers. In such cases, we may decide to restrict ourselves to compute a solution that, though not being an optimal one, nevertheless is close to the optimum and may be determined in polynomial time. We call this type of solution an approximate solution and the corresponding algorithm a polynomial-time approximation algorithm. Most combinatorial optimization problems of great practical relevance are, indeed, computationally intractable in the above sense. In formal terms, they are classified as Np-hard optimization problems.
