Falls Sie nur an einem bestimmten Exempar interessiert sind, können Sie aus der folgenden Liste jenes wählen, an dem Sie interessiert sind:
Nur diese Ausgabe anzeigen…
Nur diese Ausgabe anzeigen…
Nur diese Ausgabe anzeigen…
Nur diese Ausgabe anzeigen…
The Design and Analysis of Algorithms (Texts and Monographs in Computer Science)
15 Angebote vergleichen
Preise | Juni 16 | März 19 | Sep. 19 |
---|---|---|---|
Schnitt | € 42,32 | € 120,59 | € 99,65 |
Nachfrage |
The Design and Analysis of Algorithms
ISBN: 9781461287575 bzw. 146128757X, in Englisch, neu.
These are my lecture notes from CS681: Design and Analysis of Algo rithms, a one-semester graduate course I taught at Cornell for three consec utive fall semesters from '88 to '90. The course serves a dual purpose: to cover core material in algorithms for graduate students in computer science preparing for their PhD qualifying exams, and to introduce theory students to some advanced topics in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At first I meant these notes to supplement and not supplant a textbook, but over the three years they gradually took on a life of their own. In addition to the notes, I depended heavily on the texts • A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975. • M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. w. H. Freeman, 1979. • R. E. Tarjan, Data Structures and Network Algorithms. SIAM Regional Conference Series in Applied Mathematics 44, 1983. and still recommend them as excellent references.
The Design and Analysis of Algorithms (Softcover reprint of the original 1st ed. 1992)
ISBN: 9781461287575 bzw. 146128757X, in Englisch, Springer-Verlag New York Inc. Taschenbuch, neu.
BRAND NEW PRINT ON DEMAND., The Design and Analysis of Algorithms (Softcover reprint of the original 1st ed. 1992), Dexter C. Kozen, These are my lecture notes from CS681: Design and Analysis of Algo- rithms, a one-semester graduate course I taught at Cornell for three consec- utive fall semesters from '88 to '90. The course serves a dual purpose: to cover core material in algorithms for graduate students in computer science preparing for their PhD qualifying exams, and to introduce theory students to some advanced topics in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At first I meant these notes to supplement and not supplant a textbook, but over the three years they gradually took on a life of their own. In addition to the notes, I depended heavily on the texts * A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975. * M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. w. H. Freeman, 1979. * R. E. Tarjan, Data Structures and Network Algorithms. SIAM Regional Conference Series in Applied Mathematics 44, 1983. and still recommend them as excellent references.
The Design and Analysis of Algorithms (Monographs in Computer Science) (1991)
ISBN: 9780387976877 bzw. 0387976876, in Englisch, 322 Seiten, 1992. Ausgabe, Springer, gebundenes Buch, neu.
Von Händler/Antiquariat, 4books7.
These are my lecture notes from CS681: Design and Analysis of Algo rithms, a one-semester graduate course I taught at Cornell for three consec utive fall semesters from '88 to '90. The course serves a dual purpose: to cover core material in algorithms for graduate students in computer science preparing for their PhD qualifying exams, and to introduce theory students to some advanced topics in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At first I meant these notes to supplement and not supplant a textbook, but over the three years they gradually took on a life of their own. In addition to the notes, I depended heavily on the texts • A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975. • M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. w. H. Freeman, 1979. • R. E. Tarjan, Data Structures and Network Algorithms. SIAM Regional Conference Series in Applied Mathematics 44, 1983. and still recommend them as excellent references. Hardcover, Ausgabe: 1992, Label: Springer, Springer, Produktgruppe: Book, Publiziert: 1991-12-03, Studio: Springer, Verkaufsrang: 960721.
The Design and Analysis of Algorithms (Monographs in Computer Science) (2011)
ISBN: 9781461287575 bzw. 146128757X, in Englisch, 322 Seiten, Springer, Taschenbuch, neu.
Von Händler/Antiquariat, affordable2015.
These are my lecture notes from CS681: Design and Analysis of Algo rithms, a one-semester graduate course I taught at Cornell for three consec utive fall semesters from '88 to '90. The course serves a dual purpose: to cover core material in algorithms for graduate students in computer science preparing for their PhD qualifying exams, and to introduce theory students to some advanced topics in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At first I meant these notes to supplement and not supplant a textbook, but over the three years they gradually took on a life of their own. In addition to the notes, I depended heavily on the texts • A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975. • M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. w. H. Freeman, 1979. • R. E. Tarjan, Data Structures and Network Algorithms. SIAM Regional Conference Series in Applied Mathematics 44, 1983. and still recommend them as excellent references. Paperback, Ausgabe: Softcover reprint of the original 1st ed. 1992, Label: Springer, Springer, Produktgruppe: Book, Publiziert: 2011-10-07, Studio: Springer, Verkaufsrang: 7900150.
The Design &Analysis of Algorithms - 1992 publication (1992)
ISBN: 9783540976875 bzw. 3540976876, in Deutsch, Springer Verlag, gebundenes Buch, gebraucht.
Item is intact, but may show shelf wear. Pages may include notes and highlighting. May or may not include supplemental or companion material. Access codes may or may not work. Connecting readers since 1972. Customer service is our top priority.
The Design &Analysis of Algorithms - 1992 publication (1992)
ISBN: 9783540976875 bzw. 3540976876, vermutlich in Englisch, Springer Verlag, gebundenes Buch, gebraucht.
Item is intact, but may show shelf wear. Pages may include notes and highlighting. May or may not include supplemental or companion material. Access codes may or may not work. Connecting readers since 1972. Customer service is our top priority.
The Design and Analysis of Algorithms (Monographs in Computer Science) [Hardcover]
ISBN: 9780387976877 bzw. 0387976876, in Englisch, Springer, Deutschland, gebundenes Buch, gebraucht.
Used book in VERY GOOD condition. Tight Spine, Cover shows minor wear. Minor markings and highlights inside the book. Text Only. Fast Shipping. Prompt Customer Service. Satisfaction guaranteed.
The Design and Analysis of Algorithms (Monographs in Computer Science) (2011)
ISBN: 9781461287575 bzw. 146128757X, in Englisch, Springer, Taschenbuch, neu, Nachdruck.
This item is printed on demand for shipment within 3 working days.
The Design and Analysis of Algorithms. (Texts and Monographs in Computer Science)
ISBN: 0387976876 bzw. 9780387976877, in Englisch, Berlin, Heidelberg, New York: Springer-Verlag, 1991, gebraucht.
Von Händler/Antiquariat, Antiquariat Thieme, [403].
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen