About the
Course
This course aims at exploring advanced computation
models, theory and advanced algorithm design and analysis techniques that
have broad applicability in solving reallife problems in
crossdisciplinary areas. The course will consist of three parts: (a) the
theory of NPcompleteness, (b) approximation techniques to cope with
intractability, and (c) randomized techniques.
Syllabus:
Theory of NPCompleteness

Turing Reductions and the Complexity Hierarchy

The classes NP, coNP, NPComplete, NPHard

Examples of classical NPHard problems
Approximation Techniques

Polynomialtime approximation schemes (PTAS)

Dynamic programming

Greedy paradigm

Branch and bound
Randomized Techniques

Probabilistic and GameTheoretic Methods

Markov Chains and Random Walks

Randomized Data Structures

Randomized Geometric and Graph Algorithms
Prerequisites
Prerequisites:
CSE 5311 or consent of instructor
References
1.
Cormen,
Leiserson, Rivest, Stein: Introduction to Algorithms. 2nd Edition, The
MIT Press, ISBN 0070131511
2.
Michael
R. Garey, David S. Johnson: Computers and Intractability: A guide to the
theory of NPcompleteness, 1979 W.H. Freeman ISBN 0716710447
3.
Jon
Kleinberg, Eva Tardos : Algorithm Design, 2005 Addison Wesley Press, ISBN
9780321295354
4.
Rajeev
Motwani, Prabhakar Raghavan: Randomized Algorithms. 1995, Cambridge
University Press, ISBN 0521474655
Grading
3
noncumulative exams worth 1/3 weight each
Announcements
May 7,2011 : Notes for Analysis of running time and recursion depth of randomized Kth smallest  PDF. New!
May 7,2011 : Notes for Coupon collector bounds using Union bound  PDF. New!
Apr 25, 2011 : Homework3 , From Motwani/Raghavan book , Chapter 1: Exercises 1.1, 1.2, 1.6, Problems 1.1, 1.4, 1.8, 1.9. Chapter 3: Problems 3.2, 3.12.Chapter 4: Exercise 4.3, Problems 4.1, 4.6, 4.9. New !
Apr 25, 2011 : Final Exam is scheduled on May 12 (Thursday) , 24:30 PM. New !
Apr 25, 2011 : Course schedule is updated to include final exam time.New !
Apr 18, 2011 : Course schedule is updated
March 25, 2011 : Sample homework for Exam2 : Homework 2 (pdf).
Mar 25,2011 : The lecture notes for Linear Programming PDF , LATEX and HTML.
Feb 7, 2011 : Sample homework for Exam1 : Homework 1 (pdf).
Feb 10, 2011 : Course schedule is updated
Feb 2,2011 : The lecture notes for Subset sum  PDF , LATEX and HTML
The
course schedule can be found at here. (last update on Feb 10, 2011)
Please
check this section regularly during the semester for updates and
announcements on the course
Ethics
statement is available here.
Please print, sign and submit it to the instructor during class.
Guideline
for emailing TA:
The subject should contain the
words "CSE6311_". Eg subject: "CSE6311_
Blah". Please follow the above rule for a speedy response.
