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

  • Not safe to deliver by Christmas NOTSANTA SAFE
    Theory of Semi-Feasible Algorithms

Theory of Semi-Feasible Algorithms

Lane A. Hemaspaandra
    Product form
      FORMAT: Hardback

      R 4,030.00 Price and availability exclusive to website

      YOU COULD EARN 4,030 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 20 - 30 Business Days
      BUY NOW PAY LATER
      From R 671.66 per month!
      3x monthly payments of R 1,343.33 with
      4x fortnightly payments of R 1,007.50 with
      The primary goal of this book is unifying and making more widely accessible the vibrant stream of research - spanning more than two decades - on the theory of semi-feasible algorithms. In doing so it demonstrates the richness inherent in central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. The book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science. Another aim of this book is to lay out a path along which the reader can quickly reach the frontiers of current research, and meet and engage the many exciting open problems in this area.
      Format: Hardback CONTRIBUTORS: Lane A. Hemaspaandra EAN: 9783540422006 COUNTRY: Germany PAGES: WEIGHT: 910 g HEIGHT: 235 cm
      PUBLISHED BY: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG DATE PUBLISHED: 2002-10-28 CITY: GENRE: COMPUTERS / Data Science / General, COMPUTERS / Machine Theory, COMPUTERS / Programming / General, COMPUTERS / Programming / Algorithms WIDTH: 155 cm SPINE:

      Book Themes:

      Discrete mathematics, Computer programming / software engineering, Algorithms and data structures, Mathematical theory of computation, Maths for computer scientists

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      The primary goal of this book is unifying and making more widely accessible the vibrant stream of research - spanning more than two decades - on the theory of semi-feasible algorithms. In doing so it demonstrates the richness inherent in central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. The book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science. Another aim of this book is to lay out a path along which the reader can quickly reach the frontiers of current research, and meet and engage the many exciting open problems in this area.
      Format: Hardback CONTRIBUTORS: Lane A. Hemaspaandra EAN: 9783540422006 COUNTRY: Germany PAGES: WEIGHT: 910 g HEIGHT: 235 cm
      PUBLISHED BY: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG DATE PUBLISHED: 2002-10-28 CITY: GENRE: COMPUTERS / Data Science / General, COMPUTERS / Machine Theory, COMPUTERS / Programming / General, COMPUTERS / Programming / Algorithms WIDTH: 155 cm SPINE:

      Book Themes:

      Discrete mathematics, Computer programming / software engineering, Algorithms and data structures, Mathematical theory of computation, 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