"Sinopsis" puede pertenecer a otra edición de este libro.
"Sobre este título" puede pertenecer a otra edición de este libro.
Gastos de envío:
GRATIS
A Estados Unidos de America
Descripción Soft Cover. Condición: new. Nº de ref. del artículo: 9781461287575
Descripción Condición: New. Nº de ref. del artículo: ABLIING23Mar2716030029994
Descripción Condición: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Nº de ref. del artículo: ria9781461287575_lsuk
Descripción Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 336 pp. Englisch. Nº de ref. del artículo: 9781461287575
Descripción Paperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Nº de ref. del artículo: C9781461287575
Descripción Condición: New. Nº de ref. del artículo: 4191316
Descripción Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Nº de ref. del artículo: 9781461287575
Descripción Paperback. Condición: Brand New. reprint edition. 330 pages. 9.25x6.10x0.70 inches. In Stock. Nº de ref. del artículo: x-146128757X
Descripción Condición: New. Book is in NEW condition. Nº de ref. del artículo: 146128757X-2-1