University of Virginia, Department of Computer Science
CS200: Computer Science, Spring 2002

Notes: Wednesday 20 February 2002
Schedule

Notes

Upper bound O ("big-oh"): f(x) is O (g (x)) means there is a positive constant c such that c * f(x) < g(x) for all but a finite number of x values.

Lower bound Ω ("omega"): f(x) is Ω (g (x)) means there is a positive constant c such that c * f(x) > g(x) for all but a finite number of x values. Tight bound Θ ("theta"): f(x) is Θ (g (x)) means that f(x) is O(g (x)) and f(x) is Ω (g (x)).









What is the difference between a tractable and intractable problem?






What does it mean for a problem to be NP-complete?






What are the characteristics of NP-complete problems?










How would you convince someone the smiley puzzle is NP-complete?










Why are normal puzzle typically not NP-complete?











CS 655 University of Virginia
Department of Computer Science
CS 200: Computer Science
David Evans
evans@cs.virginia.edu
Using these Materials