Slides11-Intro Lower Bounds Notes Bonnie-after-class

Slides11-Intro Lower Bounds Notes Bonnie-after-class -...

Info iconThis preview shows pages 1–11. Sign up to view the full content.

View Full Document Right Arrow Icon
Announcement: AWC 400 Level Lecture Series The AWC will be running its 400 level lecture series (400 LLS) on October 17,18 and 19 (5-6pm) in CSIC 3117. FREE FOOD. Professors who will be teaching the 400 level courses in the spring will each spend 15 minutes talking about what material the course will cover and how they intend to run it. This is a great opportunity to help you determine which 400 level course you will be interested in taking next semester. Schedule: Tuesday Kruskal 451 Getoor 421 Pop 423 Wednesday Hick 412 Golbeck 498N Zelkowitz 430 Washington 456 Thursday Jacobs 427 Hugue 420 Duraiswami 460
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lower Bounds Finding a value in a list with Divide and Conquer: Any Divide and Conquer algorithm that
Background image of page 2
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
Background image of page 11
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: recurses both sides has this form: T(n) = T(an) + T((1-a)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.

Page1 / 11

Slides11-Intro Lower Bounds Notes Bonnie-after-class -...

This preview shows document pages 1 - 11. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online