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
    Mathematics for the Analysis of Algorithms

Mathematics for the Analysis of Algorithms

Daniel H. Greene, Donald E. Knuth
    Product form
      FORMAT: Paperback / softback

      R 1,935.19 Price and availability exclusive to website

      YOU COULD EARN 1,935.19 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 322.53 per month!
      3x monthly payments of R 645.06 with
      4x fortnightly payments of R 483.79 with
      This monograph collects some fundamental mathematical techniques that are required for the analysis of algorithms. It builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is concise enough for easy reference yet detailed enough for those with little background with the material.
      Format: CONTRIBUTORS: Daniel H. Greene, Donald E. Knuth EAN: 9780817647285 COUNTRY: United States PAGES: WEIGHT: 470 g HEIGHT: 235 cm
      PUBLISHED BY: Birkhauser Boston Inc DATE PUBLISHED: 2007-10-05 CITY: GENRE: COMPUTERS / Data Science / General, COMPUTERS / Programming / Algorithms, MATHEMATICS / Counting & Numeration, MATHEMATICS / Number Systems WIDTH: 155 cm SPINE:

      Book Themes:

      Numerical analysis, Algorithms and data structures, Maths for computer scientists

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      This monograph collects some fundamental mathematical techniques that are required for the analysis of algorithms. It builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is concise enough for easy reference yet detailed enough for those with little background with the material.
      Format: CONTRIBUTORS: Daniel H. Greene, Donald E. Knuth EAN: 9780817647285 COUNTRY: United States PAGES: WEIGHT: 470 g HEIGHT: 235 cm
      PUBLISHED BY: Birkhauser Boston Inc DATE PUBLISHED: 2007-10-05 CITY: GENRE: COMPUTERS / Data Science / General, COMPUTERS / Programming / Algorithms, MATHEMATICS / Counting & Numeration, MATHEMATICS / Number Systems WIDTH: 155 cm SPINE:

      Book Themes:

      Numerical analysis, Algorithms and data structures, Maths for computer scientists

      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