Space Complexity. Master Informatique. Université Paris 5 René Descartes. Master Info. Complexity Space 1/26
|
|
- Rolf Phillips
- 5 years ago
- Views:
Transcription
1 Space Complexity Master Informatique Université Paris 5 René Descartes 2016 Master Info. Complexity Space 1/26
2 Outline Basics on Space Complexity Main Space Complexity Classes Deterministic and Non-Deterministic Space Space-Time Relations Determining Space Complexity Hardness and Completeness Well-Known Problems Master Info. Complexity Space 2/26
3 Space Used by a Turing Machine If M is a Turing Machine and x an input word, the space used by M on x is the number of different squares visited by M during the computation. For f : N N, we say that a Turing Machine M works with space O(f(n)) if M stops for every input x on every input x, M uses on x a space s(n) with s(n) O(f(n)) Master Info. Complexity Space 3/26
4 Space Complexity Classes For f : N N, DSPACE(f(n)) is the set of languages which are decided by a deterministic Turing Machine M working with space O(f(n)). For f : N N, NSPACE(f(n)) is the set of languages which are decided by a non-deterministic Turing Machine M working with space O(f(n)). Master Info. Complexity Space 4/26
5 Hierarchy Theorems Definition A mapping f : N N is space-constructible if α a constant and M a Turing Machine s.t. M(n) computes f(n) using a space less than α f(n) Master Info. Complexity Space 5/26
6 Hierarchy Theorems Definition A mapping f : N N is space-constructible if α a constant and M a Turing Machine s.t. M(n) computes f(n) using a space less than α f(n) Deterministic Space Hierarchy Theorem Let f : N N and g : N N be two mappings such that n N, f(x) 0, g is space-constructible and f o(g). Then DSPACE(f(n)) DSPACE(g(n)) Master Info. Complexity Space 5/26
7 Hierarchy Theorems Definition A mapping f : N N is space-constructible if α a constant and M a Turing Machine s.t. M(n) computes f(n) using a space less than α f(n) Deterministic Space Hierarchy Theorem Let f : N N and g : N N be two mappings such that n N, f(x) 0, g is space-constructible and f o(g). Then DSPACE(f(n)) DSPACE(g(n)) Non-Deterministic Space Hierarchy Theorem Let f : N N and g : N N be two mappings such that n N, f(x) 0, g is space-constructible and f o(g). Then NSPACE(f(n)) NSPACE(g(n)) Master Info. Complexity Space 5/26
8 Deterministic vs Non-Deterministic Space Intuition: Non-determinism is not so important for space complexity... Theorem [Savitch 1970] For all function s space-constructible, DSPACE(f(n)) NSPACE(f(n)) DSPACE(f(n) 2 ) Master Info. Complexity Space 6/26
9 Complement Classes Proposition For all function f(n) space-constructible, DSPACE(f(n)) = codspace(f(n)) Theorem [Immerman 1988, Szelepcsényi 1988] For all function f(n) log(n) space-constructible, NSPACE(f(n)) = conspace(f(n)) Master Info. Complexity Space 7/26
10 Outline Basics on Space Complexity Main Space Complexity Classes Deterministic and Non-Deterministic Space Space-Time Relations Determining Space Complexity Hardness and Completeness Well-Known Problems Master Info. Complexity Space 8/26
11 Deterministic Space Complexity L = DSPACE(log(n)) is the class of decision problems that can be solved by a DTM using logarithmic space PSPACE = k>0 DSPACE(nk ) is the class of decision problems that can be solved by a DTM using polynomial space Master Info. Complexity Space 9/26
12 Deterministic Space Complexity L = DSPACE(log(n)) is the class of decision problems that can be solved by a DTM using logarithmic space PSPACE = k>0 DSPACE(nk ) is the class of decision problems that can be solved by a DTM using polynomial space L PSPACE Master Info. Complexity Space 9/26
13 Non-Deterministic Space Complexity NL = NSPACE(log(n)) is the class of decision problems that can be solved by a NDTM using logarithmic space NPSPACE = k>0 NSPACE(nk ) is the class of decision problems that can be solved by a NDTM using polynomial space Master Info. Complexity Space 10/26
14 Non-Deterministic Space Complexity NL = NSPACE(log(n)) is the class of decision problems that can be solved by a NDTM using logarithmic space NPSPACE = k>0 NSPACE(nk ) is the class of decision problems that can be solved by a NDTM using polynomial space NL NPSPACE Master Info. Complexity Space 10/26
15 PSPACE vs NPSPACE Proposition PSPACE = NPSPACE Master Info. Complexity Space 11/26
16 PSPACE vs NPSPACE Proposition PSPACE = NPSPACE Proof: For any k > 0, NSPACE(n k ) DSPACE((n k ) 2 ) = DSPACE((n 2k ) PSPACE, so NPSPACE PSPACE For any k > 0, DSPACE(n k ) NSPACE(n k ) NPSPACE, so PSPACE NPSPACE Master Info. Complexity Space 11/26
17 Relations Between Time and Space (1/3) Proposition For any mapping f : N N, NTIME(f(n)) DSPACE(f(n)) Master Info. Complexity Space 12/26
18 Relations Between Time and Space (1/3) Proposition For any mapping f : N N, NTIME(f(n)) DSPACE(f(n)) Corollary NP PSPACE Master Info. Complexity Space 12/26
19 Relations Between Time and Space (2/3) Polynomial Hierarchy vs Polynomial Space PH PSPACE Intuition For each class of the polynomial hierharchy, there is a complete problem i QBF or i QBF. All these problems are special instances of TQBF, so they are in PSPACE. Master Info. Complexity Space 13/26
20 Relations Between Time and Space (3/3) L NL P NP conp P 2 ΣP 2 Π P 2 We also know that some inclusions are strict: NL PSPACE P EXP PH PSPACE EXP NEXP Master Info. Complexity Space 14/26
21 Outline Basics on Space Complexity Main Space Complexity Classes Deterministic and Non-Deterministic Space Space-Time Relations Determining Space Complexity Hardness and Completeness Well-Known Problems Master Info. Complexity Space 15/26
22 Completeness for Space Complexity Classes The notions of hardness and completeness exist for space complexity classes. For most of the complexity classes, the definition is exactly the same as hardness and completeness for time complexity Master Info. Complexity Space 16/26
23 Completeness for Space Complexity Classes The notions of hardness and completeness exist for space complexity classes. For most of the complexity classes, the definition is exactly the same as hardness and completeness for time complexity A problem P is C-hard if for every problem P in C, P P f P, i.e. there is a polynomial reduction from any problem in C to P Master Info. Complexity Space 16/26
24 Completeness for Space Complexity Classes The notions of hardness and completeness exist for space complexity classes. For most of the complexity classes, the definition is exactly the same as hardness and completeness for time complexity A problem P is C-hard if for every problem P in C, P P f P, i.e. there is a polynomial reduction from any problem in C to P A problem is C-complete if it is in C and it is C-complete Master Info. Complexity Space 16/26
25 Completeness for Space Complexity Classes The notions of hardness and completeness exist for space complexity classes. For most of the complexity classes, the definition is exactly the same as hardness and completeness for time complexity A problem P is C-hard if for every problem P in C, P P f P, i.e. there is a polynomial reduction from any problem in C to P A problem is C-complete if it is in C and it is C-complete This definition works for PSPACE-hardness and PSPACE-completeness Master Info. Complexity Space 16/26
26 Completeness for Space Complexity Classes The notions of hardness and completeness exist for space complexity classes. For most of the complexity classes, the definition is exactly the same as hardness and completeness for time complexity A problem P is C-hard if for every problem P in C, P P f P, i.e. there is a polynomial reduction from any problem in C to P A problem is C-complete if it is in C and it is C-complete This definition works for PSPACE-hardness and PSPACE-completeness It does not work for L and NL Master Info. Complexity Space 16/26
27 Logarithmic Space and Completeness Logarithmic-Space Functional Reduction A logarithmic-space functional reduction f is a total computable function from a problem P 1 to a problem P 2 such that, for any instance i of P 1, f(i) can be computed in logarithmic-space in the size of i i is a positive instance of P 1 iff f(i) is a positive instance of P 2 Notation: P 1 L f P 2 Master Info. Complexity Space 17/26
28 Logarithmic Space and Completeness Logarithmic-Space Functional Reduction A logarithmic-space functional reduction f is a total computable function from a problem P 1 to a problem P 2 such that, for any instance i of P 1, f(i) can be computed in logarithmic-space in the size of i i is a positive instance of P 1 iff f(i) is a positive instance of P 2 Notation: P 1 L f P 2 Observation: If P 1 L f P 2, then P 1 P f P 2 Master Info. Complexity Space 17/26
29 Logarithmic Space and Completeness Logarithmic-Space Functional Reduction A logarithmic-space functional reduction f is a total computable function from a problem P 1 to a problem P 2 such that, for any instance i of P 1, f(i) can be computed in logarithmic-space in the size of i i is a positive instance of P 1 iff f(i) is a positive instance of P 2 Notation: P 1 L f P 2 Observation: If P 1 L f P 2, then P 1 P f P 2 NL-Hardness and NL-Completeness A problem P is NL-hard iff P NL, P L f P A problem P is NL-complete iff P is NL-hard and P L Master Info. Complexity Space 17/26
30 What About L-Completeness? Theorem Any problem in L is L-complete with respect to L f! Master Info. Complexity Space 18/26
31 What About L-Completeness? Theorem Any problem in L is L-complete with respect to L f! To define a meaningful notion of L-completeness, the hardness must be defined with another kind of functional reductions More details in [Garey and Johnson 1979] Master Info. Complexity Space 18/26
32 Canonical PSPACE-Complete Problem Reminder: A canonical QBF is a formula Q 1 X 1, Q 2 X 2,... Q n X n, φ: Q i {, } and Q i Q i+1 X 1,... X n form a partition of the Boolean variables in φ φ is a propositional formula n QBF: is the QBF X 1, X 2,... Q n X n, φ true? n QBF: is the QBF X 1, X 2,... Q n X n, φ true? Master Info. Complexity Space 19/26
33 Canonical PSPACE-Complete Problem Reminder: A canonical QBF is a formula Q 1 X 1, Q 2 X 2,... Q n X n, φ: Q i {, } and Q i Q i+1 X 1,... X n form a partition of the Boolean variables in φ φ is a propositional formula n QBF: is the QBF X 1, X 2,... Q n X n, φ true? n QBF: is the QBF X 1, X 2,... Q n X n, φ true? Complexity of TQBF TQBF = n 1( n QBF n QBF) TQBF is PSPACE-complete Master Info. Complexity Space 19/26
34 PSPACE vs Games Tic-Tac-Toe Classical Tic-Tac-Toe: In a 3 3 grid, two players must draw some marks (X or O). The winner is the first who has placed three marks in a horizontal, vertical or diagonal row Generalized Tic-tac-toe ((m, n, k) game): In a m n grid, a player wins when he has placed k marks in a row A winning strategy at time t for a player is a sequence of moves (drawing a mark in the grid) such that the player wins. Master Info. Complexity Space 20/26
35 PSPACE vs Games Tic-Tac-Toe Classical Tic-Tac-Toe: In a 3 3 grid, two players must draw some marks (X or O). The winner is the first who has placed three marks in a horizontal, vertical or diagonal row Generalized Tic-tac-toe ((m, n, k) game): In a m n grid, a player wins when he has placed k marks in a row A winning strategy at time t for a player is a sequence of moves (drawing a mark in the grid) such that the player wins. Complexity of (m, n, k)-strat (m n k)-strat is the decision problem: Is there a winning strategy for player X in the (m, n, k) game? (m n k)-strat is PSPACE-complete Master Info. Complexity Space 20/26
36 PSPACE vs Games Tic-Tac-Toe: Intuition Determining if there is a winning strategy for player X is like asking the question: Is there a way to draw an X at step 1, such that for all possible moves of the O player at step 2, there is a way to draw an X at step 3, such that for all possible moves of the O player at step 4, there is... such that X player wins? Master Info. Complexity Space 21/26
37 PSPACE vs Games Tic-Tac-Toe: Intuition Determining if there is a winning strategy for player X is like asking the question: Is there a way to draw an X at step 1, such that for all possible moves of the O player at step 2, there is a way to draw an X at step 3, such that for all possible moves of the O player at step 4, there is... such that X player wins? This can be represented as a QBF formula Master Info. Complexity Space 21/26
38 Generalized Super Mario Bros. [Demaine et al. 2016] Figure Super Mario Bros. is PSPACE-complete Master Info. Complexity Space 22/26
39 NL-Complete Problem in Graphs Reach Given a directed graph G = N, E and two nodes n 1, n 2 N, is there a path from n 1 to n 2 in G? Theorem [Papadimitriou 1994] Reach is NL-complete Master Info. Complexity Space 23/26
40 NL-Complete Problem in Logics Reminder on 2SAT 2SAT is a special case of satisfiability problem where only CNF formulas with binary clauses are considered Theorem [Papadimitriou 1994] 2SAT is NL-complete Master Info. Complexity Space 24/26
41 References W. J. Savitch, Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences, , N. Immerman, Nondeterministic space is closed under complementation. SIAM Journal on Computing 17, , R. Szelepcsényi, The Method of Forced Enumeration for Nondeterministic Automata. Acta Informatica vol. 26, no 3, , Master Info. Complexity Space 25/26
42 References M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman. Section 7.5: Logarithmic Space, , C.H Papadimitriou, Computational Complexity. Addison-Wesley, E.D. Demaine, G. Viglietta and A. Williams. Super Mario Bros. Is Harder/Easier than We Thought. Proceedings of the 8th International Conference on Fun with Algorithms, Master Info. Complexity Space 26/26
Space 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 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 informationNon-Deterministic Time
Non-Deterministic Time Master Informatique 2016 1 Non-Deterministic Time Complexity Classes Reminder on DTM vs NDTM [Turing 1936] (q 0, x 0 ) (q 1, x 1 ) Deterministic (q n, x n ) Non-Deterministic (q
More informationComputational Complexity IV: PSPACE
Seminar on Theoretical Computer Science and Discrete Mathematics Aristotle University of Thessaloniki Context 1 Section 1: PSPACE 2 3 4 Time Complexity Time complexity of DTM M: - Increasing function t:
More informationComputability and Complexity CISC462, Fall 2018, Space complexity 1
Computability and Complexity CISC462, Fall 2018, Space complexity 1 SPACE COMPLEXITY This material is covered in Chapter 8 of the textbook. For simplicity, we define the space used by a Turing machine
More informationComplexity Theory 112. Space Complexity
Complexity Theory 112 Space Complexity We ve already seen the definition SPACE(f(n)): the languages accepted by a machine which uses O(f(n)) tape cells on inputs of length n. Counting only work space NSPACE(f(n))
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 informationLecture 22: PSPACE
6.045 Lecture 22: PSPACE 1 VOTE VOTE VOTE For your favorite course on automata and complexity Please complete the online subject evaluation for 6.045 2 Final Exam Information Who: You On What: Everything
More informationTheory of Computation. Ch.8 Space Complexity. wherein all branches of its computation halt on all
Definition 8.1 Let M be a deterministic Turing machine, DTM, that halts on all inputs. The space complexity of M is the function f : N N, where f(n) is the maximum number of tape cells that M scans on
More informationIntroduction to Advanced Results
Introduction to Advanced Results Master Informatique Université Paris 5 René Descartes 2016 Master Info. Complexity Advanced Results 1/26 Outline Boolean Hierarchy Probabilistic Complexity Parameterized
More informationLecture 20: PSPACE. November 15, 2016 CS 1010 Theory of Computation
Lecture 20: PSPACE November 15, 2016 CS 1010 Theory of Computation Recall that PSPACE = k=1 SPACE(nk ). We will see that a relationship between time and space complexity is given by: P NP PSPACE = NPSPACE
More informationCSCI 1590 Intro to Computational Complexity
CSCI 1590 Intro to Computational Complexity Complement Classes and the Polynomial Time Hierarchy John E. Savage Brown University February 9, 2009 John E. Savage (Brown University) CSCI 1590 Intro to Computational
More informationPolynomial Time Computation. Topics in Logic and Complexity Handout 2. Nondeterministic Polynomial Time. Succinct Certificates.
1 2 Topics in Logic and Complexity Handout 2 Anuj Dawar MPhil Advanced Computer Science, Lent 2010 Polynomial Time Computation P = TIME(n k ) k=1 The class of languages decidable in polynomial time. The
More informationP vs. NP Classes. Prof. (Dr.) K.R. Chowdhary.
P vs. NP Classes Prof. (Dr.) K.R. Chowdhary Email: kr.chowdhary@iitj.ac.in Formerly at department of Computer Science and Engineering MBM Engineering College, Jodhpur Monday 10 th April, 2017 kr chowdhary
More informationCOMPLEXITY THEORY. PSPACE = SPACE(n k ) k N. NPSPACE = NSPACE(n k ) 10/30/2012. Space Complexity: Savitch's Theorem and PSPACE- Completeness
15-455 COMPLEXITY THEORY Space Complexity: Savitch's Theorem and PSPACE- Completeness October 30,2012 MEASURING SPACE COMPLEXITY FINITE STATE CONTROL I N P U T 1 2 3 4 5 6 7 8 9 10 We measure space complexity
More informationIntroduction to Complexity Classes. Marcin Sydow
Denition TIME(f(n)) TIME(f(n)) denotes the set of languages decided by deterministic TM of TIME complexity f(n) Denition SPACE(f(n)) denotes the set of languages decided by deterministic TM of SPACE complexity
More informationThe space complexity of a standard Turing machine. The space complexity of a nondeterministic Turing machine
298 8. Space Complexity The space complexity of a standard Turing machine M = (Q,,,, q 0, accept, reject) on input w is space M (w) = max{ uav : q 0 w M u q av, q Q, u, a, v * } The space complexity of
More information1 PSPACE-Completeness
CS 6743 Lecture 14 1 Fall 2007 1 PSPACE-Completeness Recall the NP-complete problem SAT: Is a given Boolean formula φ(x 1,..., x n ) satisfiable? The same question can be stated equivalently as: Is the
More informationCSCI 1590 Intro to Computational Complexity
CSCI 1590 Intro to Computational Complexity PSPACE-Complete Languages John E. Savage Brown University February 11, 2009 John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February
More informationSOLUTION: SOLUTION: SOLUTION:
Convert R and S into nondeterministic finite automata N1 and N2. Given a string s, if we know the states N1 and N2 may reach when s[1...i] has been read, we are able to derive the states N1 and N2 may
More informationP = k T IME(n k ) Now, do all decidable languages belong to P? Let s consider a couple of languages:
CS 6505: Computability & Algorithms Lecture Notes for Week 5, Feb 8-12 P, NP, PSPACE, and PH A deterministic TM is said to be in SP ACE (s (n)) if it uses space O (s (n)) on inputs of length n. Additionally,
More informationSpace and Nondeterminism
CS 221 Computational Complexity, Lecture 5 Feb 6, 2018 Space and Nondeterminism Instructor: Madhu Sudan 1 Scribe: Yong Wook Kwon Topic Overview Today we ll talk about space and non-determinism. For some
More informationReview of Basic Computational Complexity
Lecture 1 Review of Basic Computational Complexity March 30, 2004 Lecturer: Paul Beame Notes: Daniel Lowd 1.1 Preliminaries 1.1.1 Texts There is no one textbook that covers everything in this course. Some
More informationCS5371 Theory of Computation. Lecture 23: Complexity VIII (Space Complexity)
CS5371 Theory of Computation Lecture 23: Complexity VIII (Space Complexity) Objectives Introduce Space Complexity Savitch s Theorem The class PSPACE Space Complexity Definition [for DTM]: Let M be a DTM
More informationChapter 1 - Time and Space Complexity. deterministic and non-deterministic Turing machine time and space complexity classes P, NP, PSPACE, NPSPACE
Chapter 1 - Time and Space Complexity deterministic and non-deterministic Turing machine time and space complexity classes P, NP, PSPACE, NPSPACE 1 / 41 Deterministic Turing machines Definition 1.1 A (deterministic
More informationCSE200: Computability and complexity Space Complexity
CSE200: Computability and complexity Space Complexity Shachar Lovett January 29, 2018 1 Space complexity We would like to discuss languages that may be determined in sub-linear space. Lets first recall
More informationDe Morgan s a Laws. De Morgan s laws say that. (φ 1 φ 2 ) = φ 1 φ 2, (φ 1 φ 2 ) = φ 1 φ 2.
De Morgan s a Laws De Morgan s laws say that (φ 1 φ 2 ) = φ 1 φ 2, (φ 1 φ 2 ) = φ 1 φ 2. Here is a proof for the first law: φ 1 φ 2 (φ 1 φ 2 ) φ 1 φ 2 0 0 1 1 0 1 1 1 1 0 1 1 1 1 0 0 a Augustus DeMorgan
More informationTheory of Computation Space Complexity. (NTU EE) Space Complexity Fall / 1
Theory of Computation Space Complexity (NTU EE) Space Complexity Fall 2016 1 / 1 Space Complexity Definition 1 Let M be a TM that halts on all inputs. The space complexity of M is f : N N where f (n) is
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 informationCS Lecture 29 P, NP, and NP-Completeness. k ) for all k. Fall The class P. The class NP
CS 301 - Lecture 29 P, NP, and NP-Completeness Fall 2008 Review Languages and Grammars Alphabets, strings, languages Regular Languages Deterministic Finite and Nondeterministic Automata Equivalence of
More informationPOLYNOMIAL SPACE QSAT. Games. Polynomial space cont d
T-79.5103 / Autumn 2008 Polynomial Space 1 T-79.5103 / Autumn 2008 Polynomial Space 3 POLYNOMIAL SPACE Polynomial space cont d Polynomial space-bounded computation has a variety of alternative characterizations
More informationNotes on Space-Bounded Complexity
U.C. Berkeley CS172: Automata, Computability and Complexity Handout 6 Professor Luca Trevisan 4/13/2004 Notes on Space-Bounded Complexity These are notes for CS278, Computational Complexity, scribed by
More informationMm7 Intro to distributed computing (jmp) Mm8 Backtracking, 2-player games, genetic algorithms (hps) Mm9 Complex Problems in Network Planning (JMP)
Algorithms and Architectures II H-P Schwefel, Jens M. Pedersen Mm6 Advanced Graph Algorithms (hps) Mm7 Intro to distributed computing (jmp) Mm8 Backtracking, 2-player games, genetic algorithms (hps) Mm9
More informationsatisfiability (sat) Satisfiability unsatisfiability (unsat or sat complement) and validity Any Expression φ Can Be Converted into CNFs and DNFs
Any Expression φ Can Be Converted into CNFs and DNFs φ = x j : This is trivially true. φ = φ 1 and a CNF is sought: Turn φ 1 into a DNF and apply de Morgan s laws to make a CNF for φ. φ = φ 1 and a DNF
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 4 NP-completeness Recap: relations between classes EXP PSPACE = NPSPACE conp NP conp
More informationNP-Completeness. f(n) \ n n sec sec sec. n sec 24.3 sec 5.2 mins. 2 n sec 17.9 mins 35.
NP-Completeness Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and Johnson, W.H. Freeman and Company, 1979. NP-Completeness 1 General Problems, Input Size and
More informationUndirected ST-Connectivity in Log-Space. Omer Reingold. Presented by: Thang N. Dinh CISE, University of Florida, Fall, 2010
Undirected ST-Connectivity in Log-Space Omer Reingold Presented by: Thang N. Dinh CISE, University of Florida, Fall, 2010 Undirected s-t connectivity(ustcon) Is t reachable from s in a undirected graph
More informationAdvanced Topics in Theoretical Computer Science
Advanced Topics in Theoretical Computer Science Part 5: Complexity (Part II) 30.01.2014 Viorica Sofronie-Stokkermans Universität Koblenz-Landau e-mail: sofronie@uni-koblenz.de 1 Contents Recall: Turing
More informationP, NP, and Beyond. Hengfeng Wei. May 01 May 04, Hengfeng Wei P, NP, and Beyond May 01 May 04, / 29
P, NP, and Beyond Hengfeng Wei hfwei@njueducn May 01 May 04, 2017 Hengfeng Wei (hfwei@njueducn) P, NP, and Beyond May 01 May 04, 2017 1 / 29 P, NP, and Beyond 1 2 Reductions: Tetris is NP-complete P P
More informationSpace Complexity. Huan Long. Shanghai Jiao Tong University
Space Complexity Huan Long Shanghai Jiao Tong University Acknowledgements Part of the slides comes from a similar course in Fudan University given by Prof. Yijia Chen. http://basics.sjtu.edu.cn/ chen/
More informationNotes on Space-Bounded Complexity
U.C. Berkeley CS172: Automata, Computability and Complexity Handout 7 Professor Luca Trevisan April 14, 2015 Notes on Space-Bounded Complexity These are notes for CS278, Computational Complexity, scribed
More informationCould we potentially place A in a smaller complexity class if we consider other computational models?
Introduction to Complexity Theory Big O Notation Review Linear function: r(n) =O(n). Polynomial function: r(n) =2 O(1) Exponential function: r(n) =2 no(1) Logarithmic function: r(n) = O(log n) Poly-log
More informationMTAT Complexity Theory October 20th-21st, Lecture 7
MTAT.07.004 Complexity Theory October 20th-21st, 2011 Lecturer: Peeter Laud Lecture 7 Scribe(s): Riivo Talviste Polynomial hierarchy 1 Turing reducibility From the algorithmics course, we know the notion
More informationTime Complexity. Definition. Let t : n n be a function. NTIME(t(n)) = {L L is a language decidable by a O(t(n)) deterministic TM}
Time Complexity Definition Let t : n n be a function. TIME(t(n)) = {L L is a language decidable by a O(t(n)) deterministic TM} NTIME(t(n)) = {L L is a language decidable by a O(t(n)) non-deterministic
More informationIntroduction to Computational Complexity
Introduction to Computational Complexity George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 400 George Voutsadakis (LSSU) Computational Complexity September
More informationTheory of Computation CS3102 Spring 2015 A tale of computers, math, problem solving, life, love and tragic death
Theory of Computation CS3102 Spring 2015 A tale of computers, math, problem solving, life, love and tragic death Robbie Hott www.cs.virginia.edu/~jh2jf Department of Computer Science University of Virginia
More informationIntroduction to Complexity Theory. Bernhard Häupler. May 2, 2006
Introduction to Complexity Theory Bernhard Häupler May 2, 2006 Abstract This paper is a short repetition of the basic topics in complexity theory. It is not intended to be a complete step by step introduction
More informationNotes on Complexity Theory Last updated: October, Lecture 6
Notes on Complexity Theory Last updated: October, 2015 Lecture 6 Notes by Jonathan Katz, lightly edited by Dov Gordon 1 PSPACE and PSPACE-Completeness As in our previous study of N P, it is useful to identify
More informationResource-Bounded Computation
Resource-Bounded Computation Previously: can something be done? Now: how efficiently can it be done? Goal: conserve computational resources: Time, space, other resources? Def: L is decidable within time
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 informationCS151 Complexity Theory. Lecture 4 April 12, 2017
CS151 Complexity Theory Lecture 4 A puzzle A puzzle: two kinds of trees depth n...... cover up nodes with c colors promise: never color arrow same as blank determine which kind of tree in poly(n, c) steps?
More informationAlgorithms & Complexity II Avarikioti Zeta
Algorithms & Complexity II Avarikioti Zeta March 17, 2014 Alternating Computation Alternation: generalizes non-determinism, where each state is either existential or universal : Old: existential states
More informationINAPPROX APPROX PTAS. FPTAS Knapsack P
CMPSCI 61: Recall From Last Time Lecture 22 Clique TSP INAPPROX exists P approx alg for no ε < 1 VertexCover MAX SAT APPROX TSP some but not all ε< 1 PTAS all ε < 1 ETSP FPTAS Knapsack P poly in n, 1/ε
More informationSpace Complexity. The space complexity of a program is how much memory it uses.
Space Complexity The space complexity of a program is how much memory it uses. Measuring Space When we compute the space used by a TM, we do not count the input (think of input as readonly). We say that
More informationLecture 8. MINDNF = {(φ, k) φ is a CNF expression and DNF expression ψ s.t. ψ k and ψ is equivalent to φ}
6.841 Advanced Complexity Theory February 28, 2005 Lecture 8 Lecturer: Madhu Sudan Scribe: Arnab Bhattacharyya 1 A New Theme In the past few lectures, we have concentrated on non-uniform types of computation
More information6.045 Final Exam Solutions
6.045J/18.400J: Automata, Computability and Complexity Prof. Nancy Lynch, Nati Srebro 6.045 Final Exam Solutions May 18, 2004 Susan Hohenberger Name: Please write your name on each page. This exam is open
More informationNP Complete Problems. COMP 215 Lecture 20
NP Complete Problems COMP 215 Lecture 20 Complexity Theory Complexity theory is a research area unto itself. The central project is classifying problems as either tractable or intractable. Tractable Worst
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 informationHierarchy theorems. Evgenij Thorstensen V18. Evgenij Thorstensen Hierarchy theorems V18 1 / 18
Hierarchy theorems Evgenij Thorstensen V18 Evgenij Thorstensen Hierarchy theorems V18 1 / 18 Comparing functions To prove results like TIME(f(n)) TIME(g(n)), we need a stronger notion of one function growing
More informationLecture 8: Complete Problems for Other Complexity Classes
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 8: Complete Problems for Other Complexity Classes David Mix Barrington and Alexis Maciel
More informationΤαουσάκος Θανάσης Αλγόριθμοι και Πολυπλοκότητα II 7 Φεβρουαρίου 2013
Ταουσάκος Θανάσης Αλγόριθμοι και Πολυπλοκότητα II 7 Φεβρουαρίου 2013 Alternation: important generalization of non-determinism Redefining Non-Determinism in terms of configurations: a configuration lead
More informationLecture 21: Space Complexity (The Final Exam Frontier?)
6.045 Lecture 21: Space Complexity (The Final Exam Frontier?) 1 conp NP MIN-FORMULA conp P NP FIRST-SAT TAUT P FACTORING SAT NP NP NP 2 VOTE VOTE VOTE For your favorite course on automata and complexity
More informationComplexity: Some examples
Algorithms and Architectures III: Distributed Systems H-P Schwefel, Jens M. Pedersen Mm6 Distributed storage and access (jmp) Mm7 Introduction to security aspects (hps) Mm8 Parallel complexity (hps) Mm9
More informationCS5371 Theory of Computation. Lecture 23: Complexity VIII (Space Complexity)
CS5371 Theory of Computation Lecture 23: Complexity VIII (Space Complexity) Objectives Introduce Space Complexity Savitch s Theorem The class PSPACE Space Complexity Definition [for DTM]: Let M be a DTM
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 informationPSPACE COMPLETENESS TBQF. THURSDAY April 17
PSPACE COMPLETENESS TBQF THURSDAY April 17 Definition: Language B is PSPACE-complete if: 1. B PSPACE 2. Every A in PSPACE is poly-time reducible to B (i.e. B is PSPACE-hard) QUANTIFIED BOOLEAN FORMULAS
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 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 informationDeterministic Time and Space Complexity Measures
Deterministic Complexity Measures: Time and Space Deterministic Time and Space Complexity Measures Definition Let M be any DTM with L(M) Σ, and let x Σ be any input. For the computation M(x), define the
More informationMTAT Complexity Theory October 13th-14th, Lecture 6
MTAT.07.004 Complexity Theory October 13th-14th, 2011 Lecturer: Peeter Laud Lecture 6 Scribe(s): Riivo Talviste 1 Logarithmic memory Turing machines working in logarithmic space become interesting when
More informationTechnische Universität München Summer term 2010 Theoretische Informatik August 2, 2010 Dr. J. Kreiker / Dr. M. Luttenberger, J. Kretinsky SOLUTION
Technische Universität München Summer term 2010 Theoretische Informatik August 2, 2010 Dr. J. Kreiker / Dr. M. Luttenberger, J. Kretinsky SOLUTION Complexity Theory Final Exam Please note : If not stated
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 informationCS154, Lecture 17: conp, Oracles again, Space Complexity
CS154, Lecture 17: conp, Oracles again, Space Complexity Definition: conp = { L L NP } What does a conp computation look like? In NP algorithms, we can use a guess instruction in pseudocode: Guess string
More informationCSE 555 HW 5 SAMPLE SOLUTION. Question 1.
CSE 555 HW 5 SAMPLE SOLUTION Question 1. Show that if L is PSPACE-complete, then L is NP-hard. Show that the converse is not true. If L is PSPACE-complete, then for all A PSPACE, A P L. We know SAT PSPACE
More informationLecture 7: Polynomial time hierarchy
Computational Complexity Theory, Fall 2010 September 15 Lecture 7: Polynomial time hierarchy Lecturer: Kristoffer Arnsfelt Hansen Scribe: Mads Chr. Olesen Recall that adding the power of alternation gives
More informationLecture 5: The Landscape of Complexity Classes
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 5: The Landscape of Complexity Classes David Mix Barrington and Alexis Maciel July 21,
More informationTheory of Computation Chapter 1: Introduction
Theory of Computation Chapter 1: Introduction Guan-Shieng Huang Sep. 20, 2006 Feb. 9, 2009 0-0 Text Book Computational Complexity, by C. H. Papadimitriou, Addison-Wesley, 1994. 1 References Garey, M.R.
More informationBounded rationality of restricted Turing machines
Bounded rationality of restricted Turing machines Lijie Chen, Pingzhong Tang IIIS, Tsinghua University, Beijing, China September 10, 2015 Abstract Bounded rationality aims to understand the effects of
More informationOutline. Complexity Theory. Example. Sketch of a log-space TM for palindromes. Log-space computations. Example VU , SS 2018
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 3. Logarithmic Space Reinhard Pichler Institute of Logic and Computation DBAI Group TU Wien 3. Logarithmic Space 3.1 Computational
More informationCS5371 Theory of Computation. Lecture 24: Complexity IX (PSPACE-complete, L, NL, NL-complete)
CS5371 Theory of Computation Lecture 24: Complexity IX (PSPACE-complete, L, NL, NL-complete) Objectives PSPACE-complete languages + Examples The classes L and NL NL-complete languages + Examples PSPACE-complete
More informationLecture 3. 1 Terminology. 2 Non-Deterministic Space Complexity. Notes on Complexity Theory: Fall 2005 Last updated: September, 2005.
Notes on Complexity Theory: Fall 2005 Last updated: September, 2005 Jonathan Katz Lecture 3 1 Terminology For any complexity class C, we define the class coc as follows: coc def = { L L C }. One class
More informationComputability and Complexity Theory
Discrete Math for Bioinformatics WS 09/10:, by A Bockmayr/K Reinert, January 27, 2010, 18:39 9001 Computability and Complexity Theory Computability and complexity Computability theory What problems can
More informationNotes for Lecture 3... x 4
Stanford University CS254: Computational Complexity Notes 3 Luca Trevisan January 14, 2014 Notes for Lecture 3 In this lecture we introduce the computational model of boolean circuits and prove that polynomial
More informationComplete problems for classes in PH, The Polynomial-Time Hierarchy (PH) oracle is like a subroutine, or function in
Oracle Turing Machines Nondeterministic OTM defined in the same way (transition relation, rather than function) oracle is like a subroutine, or function in your favorite PL but each call counts as single
More informationLecture Notes Each circuit agrees with M on inputs of length equal to its index, i.e. n, x {0, 1} n, C n (x) = M(x).
CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 4 February 3, 2010 Scribe: Jonathan Pines 1 Agenda P-/NP- Completeness NP-intermediate problems NP vs. co-np L, NL 2 Recap Last time, we
More informationWeek 2: Defining Computation
Computational Complexity Theory Summer HSSP 2018 Week 2: Defining Computation Dylan Hendrickson MIT Educational Studies Program 2.1 Turing Machines Turing machines provide a simple, clearly defined way
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 informationOn Straight Forward Approaches to P vs NP
On Straight Forward Approaches to P vs NP or: Why complexity theorists aren t as dumb as they look! by Kevin Matulef May 12, 2001 Introduction The infamously unresolved P vs NP question exemplifies the
More informationNP-Completeness. NP-Completeness 1
NP-Completeness Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and Johnson, W.H. Freeman and Company, 1979. NP-Completeness 1 General Problems, Input Size and
More informationLTCC Course: Graph Theory 2017/18 3: Complexity and Algorithms
LTCC Course: Graph Theory 2017/18 3: Complexity and Algorithms Peter Allen 5 March 2018 The graph theory textbooks do little or no algorithms, so for this lecture we have to go somewhere else. The default
More informationLecture 23: More PSPACE-Complete, Randomized Complexity
6.045 Lecture 23: More PSPACE-Complete, Randomized Complexity 1 Final Exam Information Who: You On What: Everything through PSPACE (today) With What: One sheet (double-sided) of notes are allowed When:
More information6-1 Computational Complexity
6-1 Computational Complexity 6. Computational Complexity Computational models Turing Machines Time complexity Non-determinism, witnesses, and short proofs. Complexity classes: P, NP, conp Polynomial-time
More informationComputational complexity theory
Computational complexity theory Introduction to computational complexity theory Complexity (computability) theory deals with two aspects: Algorithm s complexity. Problem s complexity. References S. Cook,
More informationCS 6505, Complexity and Algorithms Week 7: NP Completeness
CS 6505, Complexity and Algorithms Week 7: NP Completeness Reductions We have seen some problems in P and NP, and we ve talked about space complexity. The Space Hierarchy Theorem showed us that there are
More informationNP-Completeness. Sections 28.5, 28.6
NP-Completeness Sections 28.5, 28.6 NP-Completeness A language L might have these properties: 1. L is in NP. 2. Every language in NP is deterministic, polynomial-time reducible to L. L is NP-hard iff it
More informationMore Complexity. Klaus Sutner Carnegie Mellon University. Fall 2017
More Complexity Klaus Sutner Carnegie Mellon University Fall 2017 1 Below NP Parallelism Above NP Where Are We? 3 We have a somewhat elaborate zoo of low complexity classes. For the flagship P and NP,
More informationQuantified Boolean Formulas Part 1
Quantified Boolean Formulas Part 1 Uwe Egly Knowledge-Based Systems Group Institute of Information Systems Vienna University of Technology Results of the SAT 2009 application benchmarks for leading solvers
More informationComplexity Theory Final Exam
Technische Universität München Summer term 2010 Theoretische Informatik August 2, 2010 Dr. J. Kreiker / Dr. M. Luttenberger, J. Kretinsky Complexity Theory Final Exam Please note : If not stated otherwise,
More information