This preview shows pages 1–11. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: recurses both sides has this form: T(n) = T(an) + T((1a)n) + b , where minimum value of b = 1. The Simplex problem in linear algebra is an interesting one to consider. algorithms exist with polynomial expected runtime, but this doesnt change the upper bound of the problem people came up with new pivot rules for the Dantzig algorithm, but there has always been some input that would force the algorithm to run in exponential time the question of whether a pivot rule exists that would not have any cases end up leading to worse than polynomial time is still (as far as I know) an open one...
View
Full
Document
This note was uploaded on 01/13/2012 for the course CMSC 351 taught by Professor Staff during the Fall '11 term at University of Louisville.
 Fall '11
 Staff

Click to edit the document details