Umans Complexity Theory Lectures Lecture 3d: Nondeterminism: Sparse Languages and NP Berman’s Theorem: Unary NP complete => P=NP.

Slides:



Advertisements
Similar presentations
Complexity Classes: P and NP
Advertisements

CS151 Complexity Theory Lecture 4 April 11, 2013.
Theory of Computing Lecture 18 MAS 714 Hartmut Klauck.
Polynomial-time reductions We have seen several reductions:
Department of Computer Science & Engineering
NP-Completeness Lecture for CS 302. Traveling Salesperson Problem You have to visit n cities You want to make the shortest trip How could you do this?
The Theory of NP-Completeness
Great Theoretical Ideas in Computer Science for Some.
CSE373: Data Structures & Algorithms Lecture 24: The P vs. NP question, NP-Completeness Nicki Dell Spring 2014 CSE 373 Algorithms and Data Structures 1.
Umans Complexity Theory Lectures Lecture 2a: Reductions & Completeness.
© The McGraw-Hill Companies, Inc., Chapter 8 The Theory of NP-Completeness.
Umans Complexity Theory Lectures Lecture 15: Approximation Algorithms and Probabilistically Checkable Proofs (PCPs)
Discrete Structures & Algorithms The P vs. NP Question EECE 320.
Complexity 12-1 Complexity Andrei Bulatov Non-Deterministic Space.
Computability and Complexity 13-1 Computability and Complexity Andrei Bulatov The Class NP.
1 Polynomial Church-Turing thesis A decision problem can be solved in polynomial time by using a reasonable sequential model of computation if and only.
1 Polynomial Church-Turing thesis A decision problem can be solved in polynomial time by using a reasonable sequential model of computation if and only.
1 Polynomial Time Reductions Polynomial Computable function : For any computes in polynomial time.
CSE 326: Data Structures NP Completeness Ben Lerner Summer 2007.
Chapter 1 The Self-Reducibility Technique Matt Boutell and Bill Scherer CSC 486 April 4, 2001.
Submitted by : Estrella Eisenberg Yair Kaufman Ohad Lipsky Riva Gonen Shalom.
NP-Completeness NP-Completeness Graphs 4/17/2017 4:10 AM x x x x x x x
CSE 421 Algorithms Richard Anderson Lecture 27 NP Completeness.
Chapter 11: Limitations of Algorithmic Power
Toward NP-Completeness: Introduction Almost all the algorithms we studies so far were bounded by some polynomial in the size of the input, so we call them.
1 CSE 417: Algorithms and Computational Complexity Winter 2001 Lecture 22 Instructor: Paul Beame.
Halting Problem. Background - Halting Problem Common error: Program goes into an infinite loop. Wouldn’t it be nice to have a tool that would warn us.
1 The Theory of NP-Completeness 2 NP P NPC NP: Non-deterministic Polynomial P: Polynomial NPC: Non-deterministic Polynomial Complete P=NP? X = P.
Complexity Theory: The P vs NP question Lecture 28 (Dec 4, 2007)
1 The Theory of NP-Completeness 2012/11/6 P: the class of problems which can be solved by a deterministic polynomial algorithm. NP : the class of decision.
Theory of Computing Lecture 17 MAS 714 Hartmut Klauck.
Great Theoretical Ideas in Computer Science.
Cs3102: Theory of Computation Class 24: NP-Completeness Spring 2010 University of Virginia David Evans.
TECH Computer Science NP-Complete Problems Problems  Abstract Problems  Decision Problem, Optimal value, Optimal solution  Encodings  //Data Structure.
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.
EMIS 8373: Integer Programming NP-Complete Problems updated 21 April 2009.
May 9, New Topic The complexity of counting.
CSC401 – Analysis of Algorithms Chapter 13 NP-Completeness Objectives: Introduce the definitions of P and NP problems Introduce the definitions of NP-hard.
COMPSCI 102 Introduction to Discrete Mathematics.
CSCI 3160 Design and Analysis of Algorithms Tutorial 10 Chengyu Lin.
1 The Theory of NP-Completeness 2 Cook ’ s Theorem (1971) Prof. Cook Toronto U. Receiving Turing Award (1982) Discussing difficult problems: worst case.
COMPSCI 102 Introduction to Discrete Mathematics.
Umans Complexity Theory Lectures Lecture 1a: Problems and Languages.
NP-Complete Problems. Running Time v.s. Input Size Concern with problems whose complexity may be described by exponential functions. Tractable problems.
CS 3343: Analysis of Algorithms Lecture 25: P and NP Some slides courtesy of Carola Wenk.
CSCI 3130: Formal languages and automata theory Andrej Bogdanov The Chinese University of Hong Kong The Cook-Levin.
NP-completeness Class of hard problems. Jaruloj ChongstitvatanaNP-complete Problems2 Outline  Introduction  Problems and Languages Turing machines and.
1 Chapter 10 Intractable Problems Switzerland Lion Monument in Lucerne.
1 CPSC 320: Intermediate Algorithm Design and Analysis July 30, 2014.
Chapter 11 Introduction to Computational Complexity Copyright © 2011 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1.
NP-Completeness Note. Some illustrations are taken from (KT) Kleinberg and Tardos. Algorithm Design (DPV)Dasgupta, Papadimitriou, and Vazirani. Algorithms.
Lecture. Today Problem set 9 out (due next Thursday) Topics: –Complexity Theory –Optimization versus Decision Problems –P and NP –Efficient Verification.
NP-complete Languages
CSCI 2670 Introduction to Theory of Computing December 2, 2004.
CSCI 2670 Introduction to Theory of Computing December 7, 2005.
CSE 421 Algorithms Richard Anderson Lecture 27 NP-Completeness Proofs.
Prof. Busch - LSU1 Busch Complexity Lectures: More NP-complete Problems.
COMPLEXITY. Satisfiability(SAT) problem Conjunctive normal form(CNF): Let S be a Boolean expression in CNF. That is, S is the product(and) of several.
1 The Theory of NP-Completeness 2 Review: Finding lower bound by problem transformation Problem X reduces to problem Y (X  Y ) iff X can be solved by.
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.
Great Theoretical Ideas in Computer Science.
CSE 332: NP Completeness, Part II Richard Anderson Spring 2016.
NP-Completeness A problem is NP-complete if: It is in NP
Richard Anderson Lecture 26 NP-Completeness
Intro to Theory of Computation
Umans Complexity Theory Lectures
CS151 Complexity Theory Lecture 4 April 12, 2019.
CS151 Complexity Theory Lecture 4 April 8, 2004.
Presentation transcript:

Umans Complexity Theory Lectures Lecture 3d: Nondeterminism: Sparse Languages and NP Berman’s Theorem: Unary NP complete => P=NP

2 Sparse languages and NP We often say NP-compete languages are “hard” More accurate: NP-complete languages are “expressive” –lots of languages reduce to them

3 Sparse languages and NP Sparse language: one that contains at most poly(n) strings of length ≤ n not very expressive – can we show this cannot be NP-complete (assuming P ≠ NP) ? –yes: [Mahaney ’82] Unary language: subset of 1* (at most n strings of length ≤ n)

4 Sparse languages and NP Theorem (Berman ’78): if a unary language is NP-complete then P = NP. Proof: –let U  1* be a unary language and assume SAT ≤ U via reduction R –φ(x 1,x 2,…,x n ) instance of SAT

5 Sparse languages and NP –self-reduction tree for φ:... φ(x 1,x 2,…,x n ) φ(1,x 2,…,x n )φ(0,x 2,…,x n ) φ(0,0,…,0) φ(1,1,…,1) satisfying assignment

6 Sparse languages and NP –applying reduction R:... R(φ(x 1,x 2,…,x n )) R(φ(1,x 2,…,x n ))R(φ(0,x 2,…,x n )) R(φ(0,0,…,0)) R(φ(1,1,…,1)) satisfying assignment

7 A puzzle cover up nodes with c colors promise: never color “arrow” same as “blank” determine which kind of tree in poly(n, c) steps?... depth n A puzzle: two kinds of trees

8 A puzzle... depth n

9 A puzzle... depth n

10 Sparse languages and NP on input of length m = |φ(x 1,x 2,…,x n )|, R produces string of length ≤ p(m) p(m) ≤ poly(m) = m c for some c>0. R’s different outputs are “colors” –1 color for strings not in 1 * –at most p(m) other colors puzzle solution  can solve SAT in poly(p(m)+1, n+1) = poly(m) time!