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.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

Thrift Books Global LLC
18300 Cascade Ave S, Ste 150, Seattle, WA, 98188, U.S.A.

Condiciones de venta:

We guarantee the condition of every book as it's described on the Abebooks website. If you're dissatisfied with your purchase or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date. Please use the "Ask bookseller a question" link to contact our dedicated Customer Service team and we will be happy to assist you.

Condiciones de env�o:

All domestic Standard and Expedited shipments are distributed from our warehouses by OSM, then handed off to the USPS for final delivery.

2-Day Shipping is delivered by FedEx, which does not deliver to PO boxes.

International shipments are tendered to the local postal service in the destination country for final delivery – we do not use courier services for international deliveries.

M�todos de pago
aceptados por la librer�a

A�adir una petici�n

Art�culos relacionados a The Design and Analysis of Algorithms

The Design and Analysis of Algorithms

Kozen, Dexter C.

Usado - Encuadernaci�n de tapa dura

Informaci�n empresarial del vendedor