Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing and/or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).

Bestandsnummer des Verk�ufers 000283327U

Verk�ufer kontaktieren

Diesen Artikel melden

Bibliografische Details

Titel: The Design and Analysis of Algorithms (Monographs in Computer Science)
Verlag: Springer
Ver�ffentlichungsdatum: 1991
Sprache: Englisch
ISBN-10: 0387976876
ISBN-13: 9780387976877
Bindung: hardcover
Ausgabe: 1992nd Edition.
Zustand: Good

�ber diesen Titel

Inhaltsangabe

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.

Rese�a del editor

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.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieterinformationen

OnePlanetBooks is dedicated to providing our customers with access to high quality merchandise at competitive prices. Your 100% satisfaction is our goal and we guarantee the condition of every book as it?s described on the AbeBooks websites. If you are not satisfied with your purchase or if the order has not arrived yet, you are eligible for a refund within 30 days of the estimated delivery date. If you have any questions about an order, please us the ?Ask Bookseller a Question? link to contact us and we will respond within 2 business days.

Zur Homepage des Verk�ufers

Unternehmensdaten des Verk�ufers

TXTB.com, LLC
2711 W Ash St., Columbia, MO, 65203, U.S.A.

Gesch�ftsbedingungen und Versandinformationen

Verkaufsbedingungen

We guarantee the condition of every book as it’s described on the AbeBooks websites. If you are not satisfied with your purchase or if the order has not arrived yet, you are eligible for a refund within 30 days of the estimated delivery date. If you have any questions about an order, please us the “Ask Bookseller a Question” link to contact us and we will respond within 2 business days.