CSCI 2670 Introduction to Theory of Computing

Slides:



Advertisements
Similar presentations
P, NP, NP-Complete Problems
Advertisements

1 Nondeterministic Space is Closed Under Complement Presented by Jing Zhang and Yingbo Wang Theory of Computation II Professor: Geoffrey Smith.
The class NP Section 7.3 Giorgi Japaridze Theory of Computability.
NP-Completeness More Reductions. Definitions P: is the class of all decision problems which can be solved in polynomial time, O(n^k) for some constant.
Department of Computer Science & Engineering
NP-complete and NP-hard problems Transitivity of polynomial-time many-one reductions Concept of Completeness and hardness for a complexity class Definition.
1 NP-Complete Problems. 2 We discuss some hard problems:  how hard? (computational complexity)  what makes them hard?  any solutions? Definitions 
Theory of Computing Lecture 16 MAS 714 Hartmut Klauck.
Complexity 15-1 Complexity Andrei Bulatov Hierarchy Theorem.
Complexity 13-1 Complexity Andrei Bulatov Hierarchy Theorem.
Complexity 18-1 Complexity Andrei Bulatov Probabilistic Algorithms.
P and NP Sipser (pages ). CS 311 Fall Polynomial time P = ∪ k TIME(n k ) … P = ∪ k TIME(n k ) … TIME(n 3 ) TIME(n 2 ) TIME(n)
CSE332: Data Abstractions Lecture 27: A Few Words on NP Dan Grossman Spring 2010.
NP-complete and NP-hard problems Transitivity of polynomial-time many-one reductions Definition of complexity class NP –Nondeterministic computation –Problems.
NP-Complete Problems Reading Material: Chapter 10 Sections 1, 2, 3, and 4 only.
Computability and Complexity 20-1 Computability and Complexity Andrei Bulatov Class NL.
NP-complete and NP-hard problems
RELATIVIZATION CSE860 Vaishali Athale. Overview Introduction Idea behind “Relativization” Concept of “Oracle” Review of Diagonalization Proof Limits of.
CS 310 – Fall 2006 Pacific University CS310 P vs NP the steel cage death match Section 7.2 November 29, 2006.
CSE 421 Algorithms Richard Anderson Lecture 27 NP Completeness.
CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Lecture NP-Completeness Jan Maluszynski, IDA, 2007
Complements of Languages in NP Osama Awwad Department of Computer Science Western Michigan University July 13, 2015.
MCS312: NP-completeness and Approximation Algorithms
חישוביות וסיבוכיות Computability and Complexity Lecture 7 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A AAAA.
Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 8: Complexity Theory.
Lecture 22 More NPC problems
1 Joe Meehean.  Log: binary search in sorted array  Linear: traverse a tree  Log-Linear: insert into a heap  Quadratic (N 2 ): your sort from P1 
CSE 326: Data Structures NP Completeness Ben Lerner Summer 2007.
Cs3102: Theory of Computation Class 24: NP-Completeness Spring 2010 University of Virginia David Evans.
CSCI 2670 Introduction to Theory of Computing November 23, 2004.
CSCI 2670 Introduction to Theory of Computing November 29, 2005.
CSCI 2670 Introduction to Theory of Computing December 1, 2004.
Week 10Complexity of Algorithms1 Hard Computational Problems Some computational problems are hard Despite a numerous attempts we do not know any efficient.
Complexity Non-determinism. NP complete problems. Does P=NP? Origami. Homework: continue on postings.
. CLASSES RP AND ZPP By: SARIKA PAMMI. CONTENTS:  INTRODUCTION  RP  FACTS ABOUT RP  MONTE CARLO ALGORITHM  CO-RP  ZPP  FACTS ABOUT ZPP  RELATION.
CSCI 3160 Design and Analysis of Algorithms Tutorial 10 Chengyu Lin.
ATM, Halting Problem, P vs. NP Chapter 4, 5 & 7. Russel’s Paradox An Index is a book that lists other books in.
Computability Heap exercise. The class P. The class NP. Verifiers. Homework: Review RELPRIME proof. Find examples of problems in NP.
Automata & Formal Languages, Feodor F. Dragan, Kent State University 1 CHAPTER 7 Time complexity Contents Measuring Complexity Big-O and small-o notation.
CSCI 2670 Introduction to Theory of Computing November 17, 2005.
CS 461 – Nov. 18 Section 7.1 Overview of complexity issues –“Can quickly decide” vs. “Can quickly verify” Measuring complexity Dividing decidable languages.
Chapter 11 Introduction to Computational Complexity Copyright © 2011 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1.
NPC.
Lecture 38 CSE 331 Dec 5, OHs today (only online 9:30-11)
Optimization/Decision Problems Optimization Problems – An optimization problem is one which asks, “What is the optimal solution to problem X?” – Examples:
Lecture. Today Problem set 9 out (due next Thursday) Topics: –Complexity Theory –Optimization versus Decision Problems –P and NP –Efficient Verification.
CSCI 2670 Introduction to Theory of Computing December 2, 2004.
CSCI 2670 Introduction to Theory of Computing December 7, 2005.
April 13 th Class Notes Hw# 5 will be worth 50 points and it will be posted tonight or tomorrow.
The NP class. NP-completeness Lecture2. The NP-class The NP class is a class that contains all the problems that can be decided by a Non-Deterministic.
Complexity Classes.
NP-Complete Problems.
CSE 105 theory of computation
Great Theoretical Ideas in Computer Science
CS4234 Optimiz(s)ation Algorithms
CSCI 2670 Introduction to Theory of Computing
Approximation algorithms
Intro to Theory of Computation
Intro to NP Completeness
Intro to Theory of Computation
CSC 4170 Theory of Computation The class NP Section 7.3.
NP-completeness The Chinese University of Hong Kong Fall 2008
Time Complexity Classes
CSC 4170 Theory of Computation The class NP Section 7.3.
Instructor: Aaron Roth
Instructor: Aaron Roth
Instructor: Aaron Roth
CSE 105 theory of computation
Instructor: Aaron Roth
Theory of Computability
Presentation transcript:

CSCI 2670 Introduction to Theory of Computing November 22, 2005

Agenda Last week Today The Class P The Class NP More on the class NP November 22, 2005

Solving vs. verifying What if we can’t solve the problem in O(nk) time? Given a problem and a potential solution, can we verify the solution is correct? November 22, 2005

Example The vertex cover problem Given a graph G = <V,E> and a number k in N, does there exist a subset V’ of V such that |V’| = k For every (u,v)E, either uV’ or vV’ November 22, 2005

Vertex cover November 22, 2005

The vertex cover problem There is no known polynomial solution to the vertex cover problem What if we have a potential solution Can we verify it in O(nk) time? November 22, 2005

Verifier M = “On input <V,E,k,V’> If |V’| ≠ k, reject For each vertex v in V’ For each edge (u,w) in E If u = v or w=v, mark (u,w) If (u,w) is not marked, reject Accept” M accepts <V,E,k,V’> if and only if |V’| = k and every edge in E has at least one endpoint in V’ Computational complexity? O(|V’|×|E|) November 22, 2005

A={w|V accepts <w,c> for some string c} The class NP Definition: A verifier for a language A is an algorithm V, where A={w|V accepts <w,c> for some string c} The string c is called a certificate of membership in A. Definition: NP is the class of languages that have polynomial-time verifiers. These problems have polynomial-time solutions on nondeterministic TM’s. November 22, 2005

Is NP closed under complementation? For example, can we verify in polynomial time that a graph cannot be 3-colored? Not obviously It seems we need to check many 3-colorings before we can conclude that none exist The 3-coloring problem is in coNP November 22, 2005

What we know NP P coNP November 22, 2005

What we don’t know Are there any problems here? NP P coNP November 22, 2005

Solving NP problems The best-known methods for solving problems in NP that are not known to be in P take exponential time Brute force search We don’t know if NP is actually in a smaller complexity class November 22, 2005