1 Computational Complexity CPSC 468/568, Fall 2007 Time: Tu & Th, 1:00-2:15 pm Room: AKW 200 Dist. Group: IV (not Natural Sci.) Satisfies “QR”

Slides:



Advertisements
Similar presentations
1 Introduction to Complexity Classes Joan Feigenbaum Jan 18, 2007.
Advertisements

5/19/2015CS 2011 CS 201 – Data Structures and Discrete Mathematics I Syllabus Spring 2014.
CS 46101–600/CS Design and Analysis of Algorithms Dr. Angela Guercio Spring 2010.
CS151 Complexity Theory Lecture 7 April 20, 2004.
1 Computational Complexity CPSC 468/568, Fall 2008 Time: Tu & Th, 1:00-2:15 pm Room: AKW 500 Satisfies the QR requirement.
IT 240 Intro to Desktop Databases Introduction. About this course Design a database: Entity Relation (ER) modeling and normalization techniques Create.
Welcome to Introduction to Java Programming At J.D.O’Bryant Science & Mathematics Chonho Lee Department of Computer Science University of Massachusetts.
ST-CS19995: Introduction to Web Interface Design Prof. Angela Guercio Spring 2008.
E-Commerce: Doing Business on the Internet CPSC 155a, Fall 2001 T, Th: 1-2:15 pm, Room DL 220 (The Co-Evolution of.
11 Economics and Computation Econ 425/563 and CPSC 455/555, Fall 2008 Time: Tu & Th, 2:30-3:45 pm Room: BCT 102
CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University.
CS – 600 Introduction to Computer Science Prof. Angela Guercio Spring 2008.
1 Computational Complexity CPSC 468b, Spring 2007 Time: Tu & Th, 1:00-2:15 pm Room: AKW 500 Dist. Group: IV (not Natural Sci.) Satisfies “QR”
1 Computational Complexity CPSC 468/568, Fall 2009 Time: Tu & Th, 2:30-3:45 pm Room: AKW 307 Satisfies the QR requirement.
E-Commerce: Doing Business on the Internet CPSC 155b, Spring 2001 T, Th: 1-2:15 pm, Room DL220
CHEMISTRY 10123/10125 Spring 2007 Instructor: Professor Tracy Hanna Phone: Office: SWR 418
1 The Internet: Co-Evolution of Technology and Society CPSC 156b, Spring 2007 Time: Tu & Th, 2:30-3:45 pm Room: ML 221 Distribution Group: IV Not QR or.
Introduction to Managerial Accounting Richard E. McDermott, Ph.D. Spring 2013.
Cpt S 471/571: Computational Genomics Spring 2015, 3 cr. Where: Sloan 9 When: M WF 11:10-12:00 Instructor weekly office hour for Spring 2015: Tuesdays.
ST-CS Introduction to Web Interface Design Fall 2010 Dr. Angela Guercio ( Course Web.
COMP Introduction to Programming Yi Hong May 13, 2015.
CS6501 Information Retrieval Course Policy Hongning Wang
1 COMS 161 Introduction to Computing Title: Course Introduction Date: August 25, 2004 Lecture Number: 1.
1 COMS 261 Computer Science I Title: Course Introduction Date: August 25, 2004 Lecture Number: 01.
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
Lecturer:Prof. Elizabeth A. Ritchie, ATMO TAs:Mr. Adrian Barnard Ms. Anita Annamalai NATS 101 Introduction to Weather and Climate Section 14: T/R 2:00.
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
CSCI 51 Introduction to Computer Science Dr. Joshua Stough January 20, 2009.
Introduction to Databases Computer Science 557 September 2007 Instructor: Joe Bockhorst University of Wisconsin - Milwaukee.
ECE 1100: Introduction to Electrical and Computer Engineering Wanda Wosik Associate Professor, ECE Dept. Notes 1 Spring 2011 Slides adapted from lectures.
Discrete Mathematics CS204 Spring CS204 Discrete Mathematics Instructor: Professor Chin-Wan Chung (Office: Rm 3406, Tel:3537) 1.Lecture 1)Time:
CSE 1340 Introduction to Computing Concepts Class 1 ~ Intro.
Programming In Perl CSCI-2230 Thursday, 2pm-3:50pm Paul Lalli - Instructor.
MAT 360 – Lecture 0 Introduction. About me  Moira Chas   Work phone :  Office Location:
Welcome to Phys 001 Your professor: Dr Silvina Gatica Office: Thirkield Office Hours: MW 11:10 to 12:10 pm or by appointment.
CS 456 Advanced Algorithms Where: Engineering Bldg When: Monday & Wednesday 12:00 – 1:15 p.m. Texts: Algorithm Design, Jon Kleinberg & Eva Tardos.
CSCI 3160 Design and Analysis of Algorithms Tutorial 10 Chengyu Lin.
ECE 2317: Applied Electricity and Magnetism Prof. D. Wilton Dept. of ECE Notes 1 Notes prepared by the EM group, University of Houston.
Computational Structures Tim Sheard & James Hook Portland State University Class Preliminaries.
11/27/2015Murali Mani -- CS5421 Database Management Systems CS Fall 2008 Instructor: Murali Mani
11/29/2015Elke A. Rundensteiner -- CS5421 Database Management Systems CS Fall 2012 Instructor: Elke Rundensteiner
Yang Cai COMP 360: Algorithm Design Lecture 1
Fall 2013 CMU CS Computational Complexity Lectures 8-9 Randomness, communication, complexity of unique solutions These slides are mostly a resequencing.
Lecture 6 NP Class. P = ? NP = ? PSPACE They are central problems in computational complexity.
Electronic Drafting DFT 58A&B Cliff Monroe - Instructor.
A Puzzle for You. Puzzle Someone is working for you for 7 days You have a gold bar, which is segmented into 7 pieces, but they are all CONNECTED You have.
Lecture 25 NP Class. P = ? NP = ? PSPACE They are central problems in computational complexity.
The Internet: Co-Evolution of Technology and Society CPSC 156a, Fall 2003 Time: Tues & Thurs, 1-2:15 pm Room: DL 220
1 CPSC 320: Intermediate Algorithm Design and Analysis July 30, 2014.
CMPT 308 — Computability and Complexity Fall 2004 Instructor: Andrei Bulatov, TA: Ramsay Dyer, Learning.
1 Introduction to Wave Optics 10:30-11:45 AM, CREOL A214 Tuesdays and Thursdays Prof. Shin-Tson Wu College of Optics & Photonics Office: CREOL Room 280.
CSE 1340 Introduction to Computing Concepts Class 1 ~ Intro.
08/29/2006 Introduction INTRODUCTION Instructor: Petru S. Fodor Class webpage: PHYSICS 243H.
1 CPSC 320: Intermediate Algorithm Design and Analysis July 30, 2014.
CS Computer Architecture Fall 2010 Dr. Angela Guercio ( Course Web Page
1 1. Which of these sequences correspond to Hamilton cycles in the graph? (a) (b) (c) (d) (e)
CSE 332: NP Completeness, Part II Richard Anderson Spring 2016.
ICS 6D Discrete Mathematics for Computer Science Fall 2014
Computer Engineering Department Islamic University of Gaza
COSC 5V90 Functional Programming and Interactive Theorem Proving
Visiting Professor: Johnathan Jones
CS 201 – Data Structures and Discrete Mathematics I
Umans Complexity Theory Lectures
COMS 161 Introduction to Computing
Richard Anderson Lecture 27 NP Completeness
CS 250, Discrete Structures, Fall 2014 Nitesh Saxena
Instructors Antonio Torralba & Bill Freeman
Administrative Issues
CS Computer Science II: Data Structures and Abstraction Fall 2009
CS 232 Geometric Algorithms: Lecture 1
Presentation transcript:

1 Computational Complexity CPSC 468/568, Fall 2007 Time: Tu & Th, 1:00-2:15 pm Room: AKW 200 Dist. Group: IV (not Natural Sci.) Satisfies “QR”

2 Partial Topic Outline Complexity classes (P, NP, L, NL, etc.) Reductions and completeness The roles of, e.g., –Randomness –Interaction –Approximation Communication complexity

3 Schedule Sept. 20: First HW Assignment Due Oct. 2: Second HW Assignment Due Oct. 11: Third HW Assignment Due Oct. 18: First In-Class Exam Oct. 23: Grades on HW1, HW2, HW3, and Ex1 will be returned to students today or earlier. Oct. 26: Drop Date Oct. 31: Fourth HW Assignment Due Nov. 13: Fifth HW Assignment Due Nov. 29: Sixth HW Assignment Due Dec. 6: Second In-Class Exam

4 Requirements Modest reading assignments 6 Written HW Assignments, each of will each be worth 10% of the course grade 2 In-Class Exams, each worth 20% of the course grade No final exam during exam week

5 Rules and Guidelines Deadlines are firm. Late penalty: 5% per day. Announcements and assignments will be posted on the class webpage (as well as conveyed in class). No “collaboration” on homeworks unless you are told otherwise. Pick up your graded homeworks and exams promptly, and tell the TA promptly if one is missing.

6 Instructor: Joan Feigenbaum Office: AKW 512 Office Hours: Tuesday 2:30 - 3:30 pm Thursday 11 am - noon Phone: Assistant: Judi Paige , AKW 507a, 9am-2pm M-F) Note: Do not send to Professor Feigenbaum, who suffers from RSI. Contact her through Ms. Paige or the TA.

7 TA: Nicholas Ruozzi Office: AKW 305 Office Hours: TBA

8 If you’re undecided … Check out: zoo.cs.yale.edu/classes/cs468/spr07 (a new complexity-theory text 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)

9 Questions?

10 Introduction to Complexity Classes

11 Computational Complexity Themes “Easy” vs. “Hard” Reductions (Equivalence) Provability Randomness

12 Poly-Time Solvable Nontrivial Example : Matching

13 Poly-Time Solvable Nontrivial Example : Matching

14 Poly-Time Verifiable Trivial Example : Hamiltonian Cycle

15 Poly-Time Verifiable Trivial Ex. : Hamiltonian Cycle

16 Is it Easier to Verify a Proof than to Find one? Fundamental Conjecture of Computational Complexity: P  NP

17 Matching: HC: Fundamentally Different Distinctions

18 Reduction of B to A If A is “Easy”, then B is, too. B Algorithm A “oracle” “black box”

19 NP-completeness P-time reduction Cook’s theorem If B ε NP, then B ≤ P-time SAT HC is NP-complete

20 Equivalence NP-complete problems are an equivalence Class under polynomial-time reductions. 10k’s problems Diverse fields Math, CS, Engineering, Economics, Physical Sci., Geography, Politics…

21 NPcoNP P

22 Random poly-time Solvable x ε L? poly-time Algorithm x r YES NO x ε {0,1} n r ε {0,1} poly(n)

23 Probabilistic Classes x ε L  “yes” w.p. ¾ x  L  “no” w.p. 1 x ε L  “yes” w.p. 1 x  L  “no” w.p. ¾ RP coRP (Outdated) Nontrivial Result PRIMES ε ZPP ( = RP ∩ coRP)

24 Two-sided Error BPP x  L  “yes”w.p. ¾ x  L  “no” w.p. ¾ Question to Audience: BPP set not known to be in RP or coRP?

25 RPcoRP ZPP NPcoNP P

26 Interactive Provability P V [PPT, ¢ ] x yes/no

27 L ε IP x ε L   P: “yes” w.p. ¾ x  L   P*: “no” w.p. ¾ Nontrivial Result Interactively Provable Poly-Space Solvable

28 PSPACE RPcoRP ZPP NPcoNP P

29 PSPACE EXP P #P PH iPiP 2P2P NP P