FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

  • Safe delivery by Christmas SANTA SAFE
    Design and Analysis of Algorithms

Design and Analysis of Algorithms

Dexter C. Kozen
    Product form
      FORMAT: Hardback

      R 3,043.48 Price and availability exclusive to website

      YOU COULD EARN 3,043.48 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 507.24 per month!
      3x monthly payments of R 1,014.49 with
      4x fortnightly payments of R 760.87 with
      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.
      Format: CONTRIBUTORS: Dexter C. Kozen EAN: 9780387976877 COUNTRY: United States PAGES: WEIGHT: 1440 g HEIGHT: 234 cm
      PUBLISHED BY: Springer-Verlag New York Inc. DATE PUBLISHED: 1991-12-03 CITY: GENRE: COMPUTERS / Programming / Algorithms WIDTH: 156 cm SPINE:

      Book Themes:

      Algorithms and data structures

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      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.
      Format: CONTRIBUTORS: Dexter C. Kozen EAN: 9780387976877 COUNTRY: United States PAGES: WEIGHT: 1440 g HEIGHT: 234 cm
      PUBLISHED BY: Springer-Verlag New York Inc. DATE PUBLISHED: 1991-12-03 CITY: GENRE: COMPUTERS / Programming / Algorithms WIDTH: 156 cm SPINE:

      Book Themes:

      Algorithms and data structures

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account