Average Case Complexity
|
|
- Rosamund Walker
- 5 years ago
- Views:
Transcription
1 Average Case Complexity
2 A fundamental question in NP-completeness theory is When, and in what sense, can an NP-complete problem be considered solvable in practice? In real life a problem often arises with a natural distribution of problem instances. What qualifies for being natural? Computational Complexity, by Y. Fu Average Case Complexity 1 / 45
3 Historically the focus was on probabilistic analysis of algorithms with respect to uniform distribution. There are hard NP-problems with easy average case algorithm. Computational Complexity, by Y. Fu Average Case Complexity 2 / 45
4 The fundamentals of the average case complexity were developed by Leonid Levin in 1986 in a two page paper. Average Case Complete Problems. SIAM Journal of Computing, 15: , It aims at an NP-completeness theory with natural distributions. Computational Complexity, by Y. Fu Average Case Complexity 3 / 45
5 Synopsis 1. Distributional Problem 2. Natural Distribution 3. DistNP-Completeness 4. SampNP-Completeness Computational Complexity, by Y. Fu Average Case Complexity 4 / 45
6 Distributional Problem Computational Complexity, by Y. Fu Average Case Complexity 5 / 45
7 Technically a problem that arises in practice is a pair consisting of a decision problem and a distribution of the problem instance. Computational Complexity, by Y. Fu Average Case Complexity 6 / 45
8 Distribution Function A distribution function µ : {0, 1} [0, 1] is from strings to real values in [0, 1] such that µ(x) µ(y) whenever x < y, and lim x µ(x) = 1. Using the lexicographic order, the order < can be defined by x < y iff x < y or x = y x y. 1. The value µ(x) is the cumulative probability at x. 2. The density function µ of µ is defined by µ(x) = µ(x) µ(x 1). Computational Complexity, by Y. Fu Average Case Complexity 7 / 45
9 A distributional problem is a pair L, µ where L {0, 1} and µ is a distribution function. We are particularly interested in the distributional problem classes that are average case counterparts of P and NP. Computational Complexity, by Y. Fu Average Case Complexity 8 / 45
10 On Average Time For every TM A and input x, let time A (x) denote the number of steps A takes on input x. 1. We say that the worst case complexity of A is polynomial if c, d. x.time A (x) c x d. 2. It seems natural to say that a distributional problem L, µ is efficiently solvable by a TM A if c, d. n. µ(x)time A (x) cn d. x {0,1} n Computational Complexity, by Y. Fu Average Case Complexity 9 / 45
11 Polynomial Time on Average However the natural definition is pathological because it is not closed under function composition, and it is not model independent. Computational Complexity, by Y. Fu Average Case Complexity 10 / 45
12 Polynomial Time on Average Consider a k-tape TM that halts in n steps on every input 0 n and in 2 n steps on input 0 n. Assume the distribution is uniform. Its expected running time is n(1 1/2 n ) + 2 n /2 n < n + 1 On a machine with only one tape the average running time would be exponential due to a quadratic slowdown. Computational Complexity, by Y. Fu Average Case Complexity 11 / 45
13 Polynomial Time on Average Let s manipulate the worst case complexity formula slightly: c, d. x. time A(x) 1 d x d c. By applying the expectation operation to the above formula we get Levin s definition of average case polynomial time. Computational Complexity, by Y. Fu Average Case Complexity 12 / 45
14 Average Case Analog of P A distributional problem L, µ is in AvgP if L is accepted by a TM A that renders true the following C, ɛ. x {0,1} µ(x) time A(x)ɛ x C. (1) For every d > 0 condition (1) is equivalent to the following C, ɛ. x {0,1} µ(x) Hint: E[X ] d E[X d ] for each d 1. time A(x)ɛ x d C. Computational Complexity, by Y. Fu Average Case Complexity 13 / 45
15 Average Case Analog of P Observations: P AvgP. An average case P-time algorithm has a high probability to run in P-time. This is due to Markov s inequality: [ timea (x) ɛ ] Pr x R {0,1} KC 1 x K. Computational Complexity, by Y. Fu Average Case Complexity 14 / 45
16 1. AvgP contains not just theoretically feasible problems, but also practically feasible problems. 2. One gets a super class of NP, denoted by AvgNP, if one replaces the TM in the definition of AvgP by NDTM. Since NP AvgNP, the hard problems in AvgNP are unlikely to have efficient algorithms. 3. One looks for a class of NP problems that have efficient average case algorithms. Computational Complexity, by Y. Fu Average Case Complexity 15 / 45
17 Natural Distribution Computational Complexity, by Y. Fu Average Case Complexity 16 / 45
18 Levin assumed that natural distributions are P-time computable. Computational Complexity, by Y. Fu Average Case Complexity 17 / 45
19 Polynomial Time Computable Distribution Levin, A distribution function µ is P-computable if there is a P-time TM that computes it. The density function of a P-computable distribution function is also P-time computable. Computational Complexity, by Y. Fu Average Case Complexity 18 / 45
20 The density function for the uniform distribution is given by 1 x ( x + 1) 1 2 x. Computational Complexity, by Y. Fu Average Case Complexity 19 / 45
21 Arguably a distribution is natural not because we can calculate it efficiently; it is natural because it can be generated efficiently. Computational Complexity, by Y. Fu Average Case Complexity 20 / 45
22 Polynomial Time Samplable Distribution Impagliazzo and Levin, A distribution function µ is P-samplable if there is a P-time PTM A such that A outputs x with probability µ(x) for all x {0, 1}. Computational Complexity, by Y. Fu Average Case Complexity 21 / 45
23 Lemma. A P-computable distribution is also P-samplable. Lemma. Assume P P P. Then there is a P-samplable distribution that is not P-computable. Computational Complexity, by Y. Fu Average Case Complexity 22 / 45
24 DistNP and SampNP A distributional problem L, µ is in DistNP if the following hold: L NP, and µ is P-computable. A distributional problem L, µ is in SampNP if the following hold: L NP, and µ is P-samplable. Computational Complexity, by Y. Fu Average Case Complexity 23 / 45
25 DistNP-Completeness Computational Complexity, by Y. Fu Average Case Complexity 24 / 45
26 A reduction between problems in DistNP is a Karp reduction. Additionally it should also satisfy some continuity property. Computational Complexity, by Y. Fu Average Case Complexity 25 / 45
27 Suppose L, µ and L, µ are distributional problems. L, µ average case reduces to L, µ, noted L, µ A L, µ, if there is a P-time computable f and polynomials p, q such that Correctness. x {0, 1}. x L f (x) L ; Length Regularity. x {0, 1}. f (x) = p( x ); Domination. y {0, 1}. x {0,1}, f (x)=y µ(x) q( y )µ (y). Computational Complexity, by Y. Fu Average Case Complexity 26 / 45
28 1. Length Regularity implies that f 1 (y) is finite for all y {0, 1}. 2. Domination condition y {0, 1}. x {0,1}, f (x)=y µ(x) q( y )µ (y) is to ensue that the reduction does not map a highly likely instance of the first problem onto a rare instance of the second problem. Otherwise an easy solution to the latter does not necessarily yield an easy solution to the former. Computational Complexity, by Y. Fu Average Case Complexity 27 / 45
29 Lemma. Average case reduction is transitive. Computational Complexity, by Y. Fu Average Case Complexity 28 / 45
30 Theorem. If L, µ A L, µ AvgP, then L, µ AvgP. Proof. Let f be a reduction from L, µ to L, µ with polynomials p, q. Let the running time of f be bounded by dn d. Clearly dn d p(n). Suppose A is a TM for L, µ and ɛ, C are such that y {0,1} µ (y) time A (y)ɛ y C. Let A be the obvious TM for L, µ obtained by composition. The inequality derived on the next slide implies L, µ AvgP. Computational Complexity, by Y. Fu Average Case Complexity 29 / 45
31 x {0,1} µ(x) time A (x) ɛ q( f (x) )d x d y=f (x) x {0,1} µ(x) y=f (x) ( timea (y)+d x d) ɛ q( y )d x d time A (y) ɛ + ( d x d) ɛ µ(x) q( y )d x d x {0,1} y=f (x) x {0,1} µ (y) y {0,1} C + 1. ( µ(x) timea (y) ɛ q( y ) y ( timea (y) ɛ y ) + 1 ) + 1 Computational Complexity, by Y. Fu Average Case Complexity 30 / 45
32 We say that L, µ is DistNP-complete if the following hold: L, µ DistNP, and L, µ A L, µ for all L, µ DistNP. Computational Complexity, by Y. Fu Average Case Complexity 31 / 45
33 Levin provided the first DistNP-complete problem in The proof we will present below is from Yuri Gurevich (1987). Complete and Incomplete Randomized NP Problems. FOCS. Computational Complexity, by Y. Fu Average Case Complexity 32 / 45
34 Distributional Bounded Halting Problem 1. Let U contain all tuples α, x, 1 t such that the NDTM N α accepts x in t steps. 2. Let µ u be the distribution on tuples α, x, 1 t of length n st. α R {0, 1} log(n), t R {0,..., n log(n)}, and x R {0, 1} n log(n) t. This distribution is P-time computable. 3. U, µ u is the distributional version of Bounded Halting. We could make µ u uniform by replacing 1 t with a string of equal length, and assign each such string the same probability. But we would lose the domination property had we done that. Computational Complexity, by Y. Fu Average Case Complexity 33 / 45
35 Peak Elimination The obvious reduction fails the Domination property. We bypass the problem by using the following lemma. Lemma. Let µ be a P-computable distribution function. There is a P-time computable function g : {0, 1} {0, 1} such that g is one-one: g(x) = g(x ) iff x = x. For every x {0, 1}, g(x) x + 1. For every y {0, 1}, µ({x y = g(x)}) 1 2 y 1. Computational Complexity, by Y. Fu Average Case Complexity 34 / 45
36 Proof Given x {0, 1}, let h(x) be the largest common prefix of the binary representations of µ(x) and µ(x 1). h is P-time computable. h(x) k if µ(x) = µ(x) µ(x 1) 2 k. h is one-one. Suppose x < x and h(x) = h(x ) with h(x) = k. The (k + 1)-th bit of µ(x) must be 1. The (k + 1)-th bit of both µ(x ) and µ(x 1) must be 1. Computational Complexity, by Y. Fu Average Case Complexity 35 / 45
37 Proof 1. For every x {0, 1} n, define g(x) = { 0x, if µ(x) 2 n, 1h(x), otherwise. Clearly g satisfies the first two conditions of the lemma. 2. We now show that µ({x y=g(x)}) 1 2 y 1 for all y {0, 1}. If y is not in the image of g, then µ({x y=g(x)}) = 0. If y = 0x and µ(x) 1, then µ({x y=g(x)}) 1 2 x If y = 1h(x) and µ(x) > 1 2 x, then h(x) log It follows that µ({x y=g(x)}) 1 2 y 1. ( 1 µ(x) 2 y 1. ). Computational Complexity, by Y. Fu Average Case Complexity 36 / 45
38 Theorem. U, µ u is DistNP-complete. Proof. Suppose L, µ DistNP. 1. Let N α be a P-time NDTM that accepts L. Define N α by On input y, guess x such that y = g(x); then execute N α (x). Let p be the polynomial running time of N α. 2. Reduction: f (x) = α, y, 1 k, where x = n and y = g(x) and k = p(n) + log(n) + n α y. 3. Correctness and Length Regularity conditions are satisfied. By definition {µ(x) α, y, 1 k = f (x)} 1. 2 y 1 Let m = α, y, 1 k. The probability that α, y, 1 k occurs is at least 2 log m y m = 1 1. So Domination condition is met. m 2 2 y Computational Complexity, by Y. Fu Average Case Complexity 37 / 45
39 It is remarkable that an NPC problem coupled with a simple distribution contains the projected image of everything in DistNP. Levin s definition of P-computable distribution is crucial to the transformation that maps an instance with higher than average probability to a shorter instance for which the probability is fair. Computational Complexity, by Y. Fu Average Case Complexity 38 / 45
40 SampNP-Completeness Computational Complexity, by Y. Fu Average Case Complexity 39 / 45
41 SampNP-Completeness We say that L, µ is SampNP-complete if the following hold: L, µ SampNP, and L, µ L, µ for all L, µ SampNP. Computational Complexity, by Y. Fu Average Case Complexity 40 / 45
42 SampNP-Completeness Theorem. (Impagliazzo and Levin, 1990) If L, µ is DistNP-complete, then it is also SampNP-complete. Proof. See the paper by Impagliazzo and Levin: No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random, FOCS, Computational Complexity, by Y. Fu Average Case Complexity 41 / 45
43 Levin has got it right after all. By restricting to the P-computable distributions, we may overlook some easy problems, but we never turn any easy problems into hard ones. Computational Complexity, by Y. Fu Average Case Complexity 42 / 45
44 Average Case Complexity vs. Worst Case Complexity Investigations have shown that it is unlikely that the existence of an efficient average case algorithm implies the existence of an efficient worst case algorithm. Computational Complexity, by Y. Fu Average Case Complexity 43 / 45
45 Application In cryptography one seeks NP problems that are hard on average. This is a strong motivation for studying average case complexity. Open Problem. Is factorization (discrete log) DistNP-hard? Computational Complexity, by Y. Fu Average Case Complexity 44 / 45
46 Open Problem 1. DistNP SampNP NP AvgNP. 2. Natural DistNP-complete problems. Computational Complexity, by Y. Fu Average Case Complexity 45 / 45
Average case Complexity
February 2, 2015 introduction So far we only studied the complexity of algorithms that solve computational task on every possible input; that is, worst-case complexity. introduction So far we only studied
More informationAverage Case Complexity: Levin s Theory
Chapter 15 Average Case Complexity: Levin s Theory 1 needs more work Our study of complexity - NP-completeness, #P-completeness etc. thus far only concerned worst-case complexity. However, algorithms designers
More informationCS294: Pseudorandomness and Combinatorial Constructions September 13, Notes for Lecture 5
UC Berkeley Handout N5 CS94: Pseudorandomness and Combinatorial Constructions September 3, 005 Professor Luca Trevisan Scribe: Gatis Midrijanis Notes for Lecture 5 In the few lectures we are going to look
More informationLecture 3: Randomness in Computation
Great Ideas in Theoretical Computer Science Summer 2013 Lecture 3: Randomness in Computation Lecturer: Kurt Mehlhorn & He Sun Randomness is one of basic resources and appears everywhere. In computer science,
More informationAll Natural NPC Problems Have Average-Case Complete Versions
Electronic Colloquium on Computational Complexity, Report No. 122 (2006) All Natural NPC Problems Have Average-Case Complete Versions Noam Livne September 20, 2006 Abstract In 1984 Levin put forward a
More informationKolmogorov complexity
Kolmogorov complexity In this section we study how we can define the amount of information in a bitstring. Consider the following strings: 00000000000000000000000000000000000 0000000000000000000000000000000000000000
More information1 Randomized complexity
80240233: Complexity of Computation Lecture 6 ITCS, Tsinghua Univesity, Fall 2007 23 October 2007 Instructor: Elad Verbin Notes by: Zhang Zhiqiang and Yu Wei 1 Randomized complexity So far our notion of
More informationPseudorandom Generators
8 Pseudorandom Generators Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 andomness is one of the fundamental computational resources and appears everywhere. In computer science,
More informationCSC 5170: Theory of Computational Complexity Lecture 5 The Chinese University of Hong Kong 8 February 2010
CSC 5170: Theory of Computational Complexity Lecture 5 The Chinese University of Hong Kong 8 February 2010 So far our notion of realistic computation has been completely deterministic: The Turing Machine
More informationP is the class of problems for which there are algorithms that solve the problem in time O(n k ) for some constant k.
Complexity Theory Problems are divided into complexity classes. Informally: So far in this course, almost all algorithms had polynomial running time, i.e., on inputs of size n, worst-case running time
More informationReductions for One-Way Functions
Reductions for One-Way Functions by Mark Liu A thesis submitted in partial fulfillment of the requirements for degree of Bachelor of Science (Honors Computer Science) from The University of Michigan 2013
More informationThe Cook-Levin Theorem
An Exposition Sandip Sinha Anamay Chaturvedi Indian Institute of Science, Bangalore 14th November 14 Introduction Deciding a Language Let L {0, 1} be a language, and let M be a Turing machine. We say M
More information1 Distributional problems
CSCI 5170: Computational Complexity Lecture 6 The Chinese University of Hong Kong, Spring 2016 23 February 2016 The theory of NP-completeness has been applied to explain why brute-force search is essentially
More information15.1 Proof of the Cook-Levin Theorem: SAT is NP-complete
CS125 Lecture 15 Fall 2016 15.1 Proof of the Cook-Levin Theorem: SAT is NP-complete Already know SAT NP, so only need to show SAT is NP-hard. Let L be any language in NP. Let M be a NTM that decides L
More informationStanford University CS254: Computational Complexity Handout 8 Luca Trevisan 4/21/2010
Stanford University CS254: Computational Complexity Handout 8 Luca Trevisan 4/2/200 Counting Problems Today we describe counting problems and the class #P that they define, and we show that every counting
More informationQ = Set of states, IE661: Scheduling Theory (Fall 2003) Primer to Complexity Theory Satyaki Ghosh Dastidar
IE661: Scheduling Theory (Fall 2003) Primer to Complexity Theory Satyaki Ghosh Dastidar Turing Machine A Turing machine is an abstract representation of a computing device. It consists of a read/write
More informationan efficient procedure for the decision problem. We illustrate this phenomenon for the Satisfiability problem.
1 More on NP In this set of lecture notes, we examine the class NP in more detail. We give a characterization of NP which justifies the guess and verify paradigm, and study the complexity of solving search
More informationCOMPRESSION OF SAMPLABLE SOURCES
COMPRESSION OF SAMPLABLE SOURCES Luca Trevisan, Salil Vadhan, and David Zuckerman Abstract. We study the compression of polynomially samplable sources. In particular, we give efficient prefix-free compression
More informationRandomness and non-uniformity
Randomness and non-uniformity JASS 2006 Course 1: Proofs and Computers Felix Weninger TU München April 2006 Outline Randomized computation 1 Randomized computation 2 Computation with advice Non-uniform
More informationLecture 3: Nondeterminism, NP, and NP-completeness
CSE 531: Computational Complexity I Winter 2016 Lecture 3: Nondeterminism, NP, and NP-completeness January 13, 2016 Lecturer: Paul Beame Scribe: Paul Beame 1 Nondeterminism and NP Recall the definition
More information1 Randomized Computation
CS 6743 Lecture 17 1 Fall 2007 1 Randomized Computation Why is randomness useful? Imagine you have a stack of bank notes, with very few counterfeit ones. You want to choose a genuine bank note to pay at
More informationNon-Approximability Results (2 nd part) 1/19
Non-Approximability Results (2 nd part) 1/19 Summary - The PCP theorem - Application: Non-approximability of MAXIMUM 3-SAT 2/19 Non deterministic TM - A TM where it is possible to associate more than one
More informationLecture 25: Cook s Theorem (1997) Steven Skiena. skiena
Lecture 25: Cook s Theorem (1997) Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.sunysb.edu/ skiena Prove that Hamiltonian Path is NP
More informationfor average case complexity 1 randomized reductions, an attempt to derive these notions from (more or less) rst
On the reduction theory for average case complexity 1 Andreas Blass 2 and Yuri Gurevich 3 Abstract. This is an attempt to simplify and justify the notions of deterministic and randomized reductions, an
More informationNP-Completeness. ch34 Hewett. Problem. Tractable Intractable Non-computable computationally infeasible super poly-time alg. sol. E.g.
NP-Completeness ch34 Hewett Problem Tractable Intractable Non-computable computationally infeasible super poly-time alg. sol. E.g., O(2 n ) computationally feasible poly-time alg. sol. E.g., O(n k ) No
More informationIf NP languages are hard on the worst-case then it is easy to find their hard instances
If NP languages are hard on the worst-case then it is easy to find their hard instances Dan Gutfreund School of Computer Science and Engineering, The Hebrew University of Jerusalem, Israel, 91904 danig@cs.huji.ac.il
More informationRandomized Computation
Randomized Computation Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach. Ahto Buldas Ahto.Buldas@ut.ee We do not assume anything about the distribution of the instances of the problem
More informationIn complexity theory, algorithms and problems are classified by the growth order of computation time as a function of instance size.
10 2.2. CLASSES OF COMPUTATIONAL COMPLEXITY An optimization problem is defined as a class of similar problems with different input parameters. Each individual case with fixed parameter values is called
More informationOn Pseudorandomness w.r.t Deterministic Observers
On Pseudorandomness w.r.t Deterministic Observers Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. oded@wisdom.weizmann.ac.il Avi Wigderson The Hebrew University,
More informationNotes for Lecture Notes 2
Stanford University CS254: Computational Complexity Notes 2 Luca Trevisan January 11, 2012 Notes for Lecture Notes 2 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationComplexity Theory. Knowledge Representation and Reasoning. November 2, 2005
Complexity Theory Knowledge Representation and Reasoning November 2, 2005 (Knowledge Representation and Reasoning) Complexity Theory November 2, 2005 1 / 22 Outline Motivation Reminder: Basic Notions Algorithms
More informationTime Complexity (1) CSCI Spring Original Slides were written by Dr. Frederick W Maier. CSCI 2670 Time Complexity (1)
Time Complexity (1) CSCI 2670 Original Slides were written by Dr. Frederick W Maier Spring 2014 Time Complexity So far we ve dealt with determining whether or not a problem is decidable. But even if it
More informationNP Completeness and Approximation Algorithms
Winter School on Optimization Techniques December 15-20, 2016 Organized by ACMU, ISI and IEEE CEDA NP Completeness and Approximation Algorithms Susmita Sur-Kolay Advanced Computing and Microelectronic
More informationNotes for Lecture 3... x 4
Stanford University CS254: Computational Complexity Notes 3 Luca Trevisan January 18, 2012 Notes for Lecture 3 In this lecture we introduce the computational model of boolean circuits and prove that polynomial
More informationNP, polynomial-time mapping reductions, and NP-completeness
NP, polynomial-time mapping reductions, and NP-completeness In the previous lecture we discussed deterministic time complexity, along with the time-hierarchy theorem, and introduced two complexity classes:
More informationComputational Complexity
p. 1/24 Computational Complexity The most sharp distinction in the theory of computation is between computable and noncomputable functions; that is, between possible and impossible. From the example of
More informationLecture 3: Reductions and Completeness
CS 710: Complexity Theory 9/13/2011 Lecture 3: Reductions and Completeness Instructor: Dieter van Melkebeek Scribe: Brian Nixon Last lecture we introduced the notion of a universal Turing machine for deterministic
More informationCS 151 Complexity Theory Spring Solution Set 5
CS 151 Complexity Theory Spring 2017 Solution Set 5 Posted: May 17 Chris Umans 1. We are given a Boolean circuit C on n variables x 1, x 2,..., x n with m, and gates. Our 3-CNF formula will have m auxiliary
More informationLecture 9 - One Way Permutations
Lecture 9 - One Way Permutations Boaz Barak October 17, 2007 From time immemorial, humanity has gotten frequent, often cruel, reminders that many things are easier to do than to reverse. Leonid Levin Quick
More informationLecture 2 (Notes) 1. The book Computational Complexity: A Modern Approach by Sanjeev Arora and Boaz Barak;
Topics in Theoretical Computer Science February 29, 2016 Lecturer: Ola Svensson Lecture 2 (Notes) Scribes: Ola Svensson Disclaimer: These notes were written for the lecturer only and may contain inconsistent
More informationPolynomial Hierarchy
Polynomial Hierarchy A polynomial-bounded version of Kleene s Arithmetic Hierarchy becomes trivial if P = NP. Karp, 1972 Computational Complexity, by Fu Yuxi Polynomial Hierarchy 1 / 44 Larry Stockmeyer
More informationThe Class NP. NP is the problems that can be solved in polynomial time by a nondeterministic machine.
The Class NP NP is the problems that can be solved in polynomial time by a nondeterministic machine. NP The time taken by nondeterministic TM is the length of the longest branch. The collection of all
More informationAnnouncements. Friday Four Square! Problem Set 8 due right now. Problem Set 9 out, due next Friday at 2:15PM. Did you lose a phone in my office?
N P NP Completeness Announcements Friday Four Square! Today at 4:15PM, outside Gates. Problem Set 8 due right now. Problem Set 9 out, due next Friday at 2:15PM. Explore P, NP, and their connection. Did
More informationLimitations of Algorithm Power
Limitations of Algorithm Power Objectives We now move into the third and final major theme for this course. 1. Tools for analyzing algorithms. 2. Design strategies for designing algorithms. 3. Identifying
More informationLecture 5: The Principle of Deferred Decisions. Chernoff Bounds
Randomized Algorithms Lecture 5: The Principle of Deferred Decisions. Chernoff Bounds Sotiris Nikoletseas Associate Professor CEID - ETY Course 2013-2014 Sotiris Nikoletseas, Associate Professor Randomized
More informationNP-completeness was introduced by Stephen Cook in 1971 in a foundational paper.
NP Completeness NP-completeness was introduced by Stephen Cook in 1971 in a foundational paper. Leonid Levin independently introduced the same concept and proved that a variant of SAT is NP-complete. 1.
More informationPrinciples of Knowledge Representation and Reasoning
Principles of Knowledge Representation and Reasoning Complexity Theory Bernhard Nebel, Malte Helmert and Stefan Wölfl Albert-Ludwigs-Universität Freiburg April 29, 2008 Nebel, Helmert, Wölfl (Uni Freiburg)
More informationU.C. Berkeley CS278: Computational Complexity Professor Luca Trevisan August 30, Notes for Lecture 1
U.C. Berkeley CS278: Computational Complexity Handout N1 Professor Luca Trevisan August 30, 2004 Notes for Lecture 1 This course assumes CS170, or equivalent, as a prerequisite. We will assume that the
More information1 Computational Problems
Stanford University CS254: Computational Complexity Handout 2 Luca Trevisan March 31, 2010 Last revised 4/29/2010 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationCSCI 1590 Intro to Computational Complexity
CSCI 1590 Intro to Computational Complexity Randomized Computation John E. Savage Brown University April 15, 2009 John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity April 15,
More informationAbout the relationship between formal logic and complexity classes
About the relationship between formal logic and complexity classes Working paper Comments welcome; my email: armandobcm@yahoo.com Armando B. Matos October 20, 2013 1 Introduction We analyze a particular
More informationSpace is a computation resource. Unlike time it can be reused. Computational Complexity, by Fu Yuxi Space Complexity 1 / 44
Space Complexity Space is a computation resource. Unlike time it can be reused. Computational Complexity, by Fu Yuxi Space Complexity 1 / 44 Synopsis 1. Space Bounded Computation 2. Logspace Reduction
More informationThe Polynomial Hierarchy
The Polynomial Hierarchy Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach. Ahto Buldas Ahto.Buldas@ut.ee Motivation..synthesizing circuits is exceedingly difficulty. It is even
More informationLecture 4 : Quest for Structure in Counting Problems
CS6840: Advanced Complexity Theory Jan 10, 2012 Lecture 4 : Quest for Structure in Counting Problems Lecturer: Jayalal Sarma M.N. Scribe: Dinesh K. Theme: Between P and PSPACE. Lecture Plan:Counting problems
More informationCS Communication Complexity: Applications and New Directions
CS 2429 - Communication Complexity: Applications and New Directions Lecturer: Toniann Pitassi 1 Introduction In this course we will define the basic two-party model of communication, as introduced in the
More informationOn Uniform Amplification of Hardness in NP
On Uniform Amplification of Hardness in NP Luca Trevisan November 4, 2004 Abstract We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove
More informationTheory of Computation
Theory of Computation Dr. Sarmad Abbasi Dr. Sarmad Abbasi () Theory of Computation 1 / 33 Lecture 20: Overview Incompressible strings Minimal Length Descriptions Descriptive Complexity Dr. Sarmad Abbasi
More informationTwo Comments on Targeted Canonical Derandomizers
Two Comments on Targeted Canonical Derandomizers Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. oded.goldreich@weizmann.ac.il April 8, 2011 Abstract We revisit
More informationCOS598D Lecture 3 Pseudorandom generators from one-way functions
COS598D Lecture 3 Pseudorandom generators from one-way functions Scribe: Moritz Hardt, Srdjan Krstic February 22, 2008 In this lecture we prove the existence of pseudorandom-generators assuming that oneway
More informationModels of Computation
Models of Computation Analysis of Algorithms Week 1, Lecture 2 Prepared by John Reif, Ph.D. Distinguished Professor of Computer Science Duke University Models of Computation (RAM) a) Random Access Machines
More informationRandomized Complexity Classes; RP
Randomized Complexity Classes; RP Let N be a polynomial-time precise NTM that runs in time p(n) and has 2 nondeterministic choices at each step. N is a polynomial Monte Carlo Turing machine for a language
More informationDRAFT. Diagonalization. Chapter 4
Chapter 4 Diagonalization..the relativized P =?NP question has a positive answer for some oracles and a negative answer for other oracles. We feel that this is further evidence of the difficulty of the
More informationPseudorandom Generators
Outlines Saint Petersburg State University, Mathematics and Mechanics 2nd April 2005 Outlines Part I: Main Approach Part II: Blum-Blum-Shub Generator Part III: General Concepts of Pseudorandom Generator
More informationPCP Theorem and Hardness of Approximation
PCP Theorem and Hardness of Approximation An Introduction Lee Carraher and Ryan McGovern Department of Computer Science University of Cincinnati October 27, 2003 Introduction Assuming NP P, there are many
More informationIndistinguishability and Pseudo-Randomness
Chapter 3 Indistinguishability and Pseudo-Randomness Recall that one main drawback of the One-time pad encryption scheme and its simple encryption operation Enc k (m) = m k is that the key k needs to be
More informationFrom Non-Adaptive to Adaptive Pseudorandom Functions
From Non-Adaptive to Adaptive Pseudorandom Functions Itay Berman Iftach Haitner January, 202 Abstract Unlike the standard notion of pseudorandom functions (PRF), a non-adaptive PRF is only required to
More informationLecture 24: Randomized Complexity, Course Summary
6.045 Lecture 24: Randomized Complexity, Course Summary 1 1/4 1/16 1/4 1/4 1/32 1/16 1/32 Probabilistic TMs 1/16 A probabilistic TM M is a nondeterministic TM where: Each nondeterministic step is called
More informationComputational Complexity: A Modern Approach. Draft of a book: Dated January 2007 Comments welcome!
i Computational Complexity: A Modern Approach Draft of a book: Dated January 2007 Comments welcome! Sanjeev Arora and Boaz Barak Princeton University complexitybook@gmail.com Not to be reproduced or distributed
More informationSummer School on Introduction to Algorithms and Optimization Techniques July 4-12, 2017 Organized by ACMU, ISI and IEEE CEDA.
Summer School on Introduction to Algorithms and Optimization Techniques July 4-12, 2017 Organized by ACMU, ISI and IEEE CEDA NP Completeness Susmita Sur-Kolay Advanced Computing and Microelectronics Unit
More informationCSC 5170: Theory of Computational Complexity Lecture 9 The Chinese University of Hong Kong 15 March 2010
CSC 5170: Theory of Computational Complexity Lecture 9 The Chinese University of Hong Kong 15 March 2010 We now embark on a study of computational classes that are more general than NP. As these classes
More informationCISC 876: Kolmogorov Complexity
March 27, 2007 Outline 1 Introduction 2 Definition Incompressibility and Randomness 3 Prefix Complexity Resource-Bounded K-Complexity 4 Incompressibility Method Gödel s Incompleteness Theorem 5 Outline
More informationComplexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard
More informationOutline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität
More informationLecture 18: PCP Theorem and Hardness of Approximation I
Lecture 18: and Hardness of Approximation I Arijit Bishnu 26.04.2010 Outline 1 Introduction to Approximation Algorithm 2 Outline 1 Introduction to Approximation Algorithm 2 Approximation Algorithm Approximation
More informationLecture 5: Two-point Sampling
Randomized Algorithms Lecture 5: Two-point Sampling Sotiris Nikoletseas Professor CEID - ETY Course 2017-2018 Sotiris Nikoletseas, Professor Randomized Algorithms - Lecture 5 1 / 26 Overview A. Pairwise
More informationA Note on the Karp-Lipton Collapse for the Exponential Hierarchy
A Note on the Karp-Lipton Collapse for the Exponential Hierarchy Chris Bourke Department of Computer Science & Engineering University of Nebraska Lincoln, NE 68503, USA Email: cbourke@cse.unl.edu January
More informationLecture 12: Randomness Continued
CS 710: Complexity Theory 2/25/2010 Lecture 12: Randomness Continued Instructor: Dieter van Melkebeek Scribe: Beth Skubak & Nathan Collins In the last lecture we introduced randomized computation in terms
More information6.842 Randomness and Computation Lecture 5
6.842 Randomness and Computation 2012-02-22 Lecture 5 Lecturer: Ronitt Rubinfeld Scribe: Michael Forbes 1 Overview Today we will define the notion of a pairwise independent hash function, and discuss its
More informationLecture 3 (Notes) 1. The book Computational Complexity: A Modern Approach by Sanjeev Arora and Boaz Barak;
Topics in Theoretical Computer Science March 7, 2016 Lecturer: Ola Svensson Lecture 3 (Notes) Scribes: Ola Svensson Disclaimer: These notes were written for the lecturer only and may contain inconsistent
More informationInaccessible Entropy and its Applications. 1 Review: Psedorandom Generators from One-Way Functions
Columbia University - Crypto Reading Group Apr 27, 2011 Inaccessible Entropy and its Applications Igor Carboni Oliveira We summarize the constructions of PRGs from OWFs discussed so far and introduce the
More information: On the P vs. BPP problem. 30/12/2016 Lecture 11
03684155: On the P vs. BPP problem. 30/12/2016 Lecture 11 Promise problems Amnon Ta-Shma and Dean Doron 1 Definitions and examples In a promise problem, we are interested in solving a problem only on a
More informationLength-Increasing Reductions for PSPACE-Completeness
Length-Increasing Reductions for PSPACE-Completeness John M. Hitchcock 1 and A. Pavan 2 1 Department of Computer Science, University of Wyoming. jhitchco@cs.uwyo.edu 2 Department of Computer Science, Iowa
More information6.045: Automata, Computability, and Complexity (GITCS) Class 17 Nancy Lynch
6.045: Automata, Computability, and Complexity (GITCS) Class 17 Nancy Lynch Today Probabilistic Turing Machines and Probabilistic Time Complexity Classes Now add a new capability to standard TMs: random
More informationNotational conventions
CHAPTER 0 Notational conventions We now specify some of the notations and conventions used throughout this book. We make use of some notions from discrete mathematics such as strings, sets, functions,
More informationCompression Complexity
Compression Complexity Stephen Fenner University of South Carolina Lance Fortnow Georgia Institute of Technology February 15, 2017 Abstract The Kolmogorov complexity of x, denoted C(x), is the length of
More informationAnalysis of Algorithms. Unit 5 - Intractable Problems
Analysis of Algorithms Unit 5 - Intractable Problems 1 Intractable Problems Tractable Problems vs. Intractable Problems Polynomial Problems NP Problems NP Complete and NP Hard Problems 2 In this unit we
More informationNotes on Complexity Theory Last updated: December, Lecture 2
Notes on Complexity Theory Last updated: December, 2011 Jonathan Katz Lecture 2 1 Review The running time of a Turing machine M on input x is the number of steps M takes before it halts. Machine M is said
More informationComputer Science A Cryptography and Data Security. Claude Crépeau
Computer Science 308-547A Cryptography and Data Security Claude Crépeau These notes are, largely, transcriptions by Anton Stiglic of class notes from the former course Cryptography and Data Security (308-647A)
More information,
Kolmogorov Complexity Carleton College, CS 254, Fall 2013, Prof. Joshua R. Davis based on Sipser, Introduction to the Theory of Computation 1. Introduction Kolmogorov complexity is a theory of lossless
More informationLecture 6: Oracle TMs, Diagonalization Limits, Space Complexity
CSE 531: Computational Complexity I Winter 2016 Lecture 6: Oracle TMs, Diagonalization Limits, Space Complexity January 22, 2016 Lecturer: Paul Beame Scribe: Paul Beame Diagonalization enabled us to separate
More informationPseudorandom Generators
Principles of Construction and Usage of Pseudorandom Generators Alexander Vakhitov June 13, 2005 Abstract In this report we try to talk about the main concepts and tools needed in pseudorandom generators
More informationLecture 59 : Instance Compression and Succinct PCP s for NP
IITM-CS6840: Advanced Complexity Theory March 31, 2012 Lecture 59 : Instance Compression and Succinct PCP s for NP Lecturer: Sivaramakrishnan N.R. Scribe: Prashant Vasudevan 1 Introduction Classical Complexity
More informationLectures One Way Permutations, Goldreich Levin Theorem, Commitments
Lectures 11 12 - One Way Permutations, Goldreich Levin Theorem, Commitments Boaz Barak March 10, 2010 From time immemorial, humanity has gotten frequent, often cruel, reminders that many things are easier
More informationChapter 5 The Witness Reduction Technique
Outline Chapter 5 The Technique Luke Dalessandro Rahul Krishna December 6, 2006 Outline Part I: Background Material Part II: Chapter 5 Outline of Part I 1 Notes On Our NP Computation Model NP Machines
More informationSAT, NP, NP-Completeness
CS 473: Algorithms, Spring 2018 SAT, NP, NP-Completeness Lecture 22 April 13, 2018 Most slides are courtesy Prof. Chekuri Ruta (UIUC) CS473 1 Spring 2018 1 / 57 Part I Reductions Continued Ruta (UIUC)
More informationU.C. Berkeley CS278: Computational Complexity Professor Luca Trevisan 9/6/2004. Notes for Lecture 3
U.C. Berkeley CS278: Computational Complexity Handout N3 Professor Luca Trevisan 9/6/2004 Notes for Lecture 3 Revised 10/6/04 1 Space-Bounded Complexity Classes A machine solves a problem using space s(
More informationQuantum pattern matching fast on average
Quantum pattern matching fast on average Ashley Montanaro Department of Computer Science, University of Bristol, UK 12 January 2015 Pattern matching In the traditional pattern matching problem, we seek
More informationComplexity Theory. Jörg Kreiker. Summer term Chair for Theoretical Computer Science Prof. Esparza TU München
Complexity Theory Jörg Kreiker Chair for Theoretical Computer Science Prof. Esparza TU München Summer term 2010 Lecture 6 conp Agenda conp the importance of P vs. NP vs. conp neither in P nor NP-complete:
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: NP-Completeness I Date: 11/13/18
601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: NP-Completeness I Date: 11/13/18 20.1 Introduction Definition 20.1.1 We say that an algorithm runs in polynomial time if its running
More informationIntractable Problems [HMU06,Chp.10a]
Intractable Problems [HMU06,Chp.10a] Time-Bounded Turing Machines Classes P and NP Polynomial-Time Reductions A 10 Minute Motivation https://www.youtube.com/watch?v=yx40hbahx3s 1 Time-Bounded TM s A Turing
More information