AnnouncementsNP-CompleteProblemsDecidablevs课件.pptVIP

AnnouncementsNP-Complete Problems Decidable vs. Undecidable ProblemsReview Review Outline at/~wl48 Online Survey The Spring term course/instructor opinion survey will be available during the period Monday, April 17th through Friday, April 28th from 6am to 11:59pm each day:  Final Exam Schedule CS1311 Sections L/M/N Tuesday/Thursday 10:00 A.M. Exam Scheduled for 8:00 Friday May 5, 2000 Physics L1 Final Exam Schedule CS1311 Sections E/F Tuesday/Thursday 2:00 P.M. Exam Scheduled for 2:50 Wednesday May 3, 2000 Physics L1 NP-Complete Problems Problems that Cross the Line What if a problem has: An exponential upper bound A polynomial lower bound We have only found exponential algorithms, so it appears to be intractable. But... we can’t prove that an exponential solution is needed, we can’t prove that a polynomial algorithm cannot be developed, so we can’t say the problem is intractable... NP-Complete Problems The upper bound suggests the problem is intractable The lower bound suggests the problem is tractable The lower bound is linear: O(N) They are all reducible to each other If we find a reasonable algorithm (or prove intractability) for one, then we can do it for all of them! Example NP-Complete Problems Path-Finding (Traveling salesman) Map coloring Scheduling and Matching (bin packing) 2-D arrangement problems Planning problems (pert planning) Clique Traveling Salesman 5-Clique Map Coloring Class Scheduling Problem With N teachers with certain hour restrictions M classes to be scheduled, can we: Schedule all the classes Make sure that no two teachers teach the same class at the same time No teacher is scheduled to teach two classes at once Certificates Returning true: in order to show that the schedule can be made, we only have to show one schedule that works This is called a certificate. Returning false: in order to show that the schedule cannot be made, we must test all schedules. Oracles If we could make the ‘right decision’ at all decision points, then