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, _va 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

I will conduct my office hours on July 14 between 2  3:30pm. Please come by during this period to review your test 2 and test 3 papers.
.
 Homework 2 (pdf).
 Homework 1 (pdf).
 The
course schedule can be found here.
 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_SUM2010". Eg subject: "CSE6311_SUM2010
My Class Notes". Please follow the above rule for a speedy response.
