Computational Complexity. CPSC 468/568, Fall 2010 Time: Tu & Th, 1:00-2:15 pm Room: AKW 500 Satisfies the QR requirement. http://zoo.cs.yale.edu/classes/cs468/. Partial Topic Outline. Complexity classes (P, NP, L, NL, etc .) Reductions and completeness The roles of, e.g ., Randomness
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
CPSC 468/568, Fall 2010Time: Tu & Th, 1:00-2:15 pmRoom: AKW 500
Satisfies the QR requirement.
Modest reading assignments, mostly in Arora and Barak, Computational Complexity: A Modern Approach, Cambridge Univ. Press, 2009.
6 Written HW Assignments, each worth 10% of the course grade
2 In-Class Exams, each worth 20% of the course grade
No final exam during exam week
Sept. 21: First HW Assignment Due
Sept. 30: Second HW Assignment Due
Oct. 12: Third HW Assignment Due
Oct. 14: First In-Class Exam
Oct. 22: Fall Semester Drop Date
Nov. 02: Fourth HW Assignment Due
Nov. 16: Fifth HW Assignment Due
Nov. 30: Sixth HW Assignment Due
Dec. 2: Second In-Class Exam
Instructor: Joan Feigenbaum
Office: AKW 512
Office Hours: Thursdays 11:30 am - 12:30 pm
and by appointment
Assistant: Judi Paige
([email protected], 203-436-1267, AKW 507a, 8:30 am – 4:30 pm M-F)
Note: Do not send email to Professor Feigenbaum, who suffers from RSI. Contact her through Ms. Paige or the TA.
TA: David Costanzo
Office: AKW 301 (or open zoo)
Email: [email protected]
Office Hours: Tuesdays, 4 – 5 pm
(draft of textbook by Sanjeev Arora and Boaz Barak of Princeton)
(a complexity-theory course taught by Luca Trevisan at Berkeley in 2002)
(“NP-Completeness: A Retrospective,” by Christos Papadimitriou, 1997 International Colloquium on Automata, Languages, and Programming)
Introduction to Complexity Classes
then B is, too.
If B εNP, then
Math, CS, Engineering, Economics, Physical Sci., Geography, Politics…
x ε L “yes” w.p. ¾
x L “no” w.p. 1
x ε L “yes” w.p. 1
x L “no” w.p. ¾
(Outdated) Nontrivial Result
PRIMES ε ZPP ( = RP ∩ coRP)
x L “yes”w.p. ¾
x L “no” w.p. ¾
Question to Audience:BPP set not known to be in RP or coRP?
Note: QR is in NP and coNP but not known to be in RP or coRP.
V [PPT, ¢]