Circuits. Lecture 11 Uniform Circuit Complexity
|
|
|
- Lee Matthews
- 5 years ago
- Views:
Transcription
1 Circuits Lecture 11 Uniform Circuit Complexity 1
2 Recall 2
3 Recall Non-uniform complexity 2
4 Recall Non-uniform complexity P/1 Decidable 2
5 Recall Non-uniform complexity P/1 Decidable NP P/log NP = P 2
6 Recall Non-uniform complexity P/1 Decidable NP P/log NP = P NP P/poly PH = Σ P 2 2
7 Recall Non-uniform complexity P/1 Decidable NP P/log NP = P NP P/poly PH = Σ P 2 Circuit Complexity 2
8 Recall Non-uniform complexity P/1 Decidable NP P/log NP = P NP P/poly PH = Σ P 2 Circuit Complexity SIZE(poly) = P/poly 2
9 Recall Non-uniform complexity P/1 Decidable NP P/log NP = P NP P/poly PH = Σ P 2 Circuit Complexity SIZE(poly) = P/poly SIZE-hierarchy 2
10 Recall Non-uniform complexity P/1 Decidable NP P/log NP = P NP P/poly PH = Σ P 2 Circuit Complexity SIZE(poly) = P/poly SIZE-hierarchy SIZE(T ) SIZE(T) if T=Ω(t2 t ) and T =O(2 t /t) 2
11 Recall Non-uniform complexity P/1 Decidable NP P/log NP = P NP P/poly PH = Σ 2 P Circuit Complexity SIZE(poly) = P/poly SIZE-hierarchy SIZE(T ) SIZE(T) if T=Ω(t2 t ) and T =O(2 t /t) Most functions on t bits (that ignore last n-t bits) are in SIZE(T) but not in SIZE(T ) 2
12 Uniform Circuits 3
13 Uniform Circuits Uniform circuit family: constructed by a TM 3
14 Uniform Circuits Uniform circuit family: constructed by a TM Undecidable languages are undecidable for these circuits families 3
15 Uniform Circuits Uniform circuit family: constructed by a TM Undecidable languages are undecidable for these circuits families Can relate their complexity classes to classes defined using TMs 3
16 Uniform Circuits Uniform circuit family: constructed by a TM Undecidable languages are undecidable for these circuits families Can relate their complexity classes to classes defined using TMs Logspace-uniform: 3
17 Uniform Circuits Uniform circuit family: constructed by a TM Undecidable languages are undecidable for these circuits families Can relate their complexity classes to classes defined using TMs Logspace-uniform: An O(log n) space TM can compute the circuit 3
18 NC i and AC i 4
19 NC i and AC i NC i : class of languages decided by bounded fan-in logspace-uniform circuits of polynomial size and depth O(log i n) 4
20 NC i and AC i NC i : class of languages decided by bounded fan-in logspace-uniform circuits of polynomial size and depth O(log i n) AC i : Similar, but unbounded fan-in circuits 4
21 NC i and AC i NC i : class of languages decided by bounded fan-in logspace-uniform circuits of polynomial size and depth O(log i n) AC i : Similar, but unbounded fan-in circuits NC 0 and AC 0 : constant depth circuits 4
22 NC i and AC i NC i : class of languages decided by bounded fan-in logspace-uniform circuits of polynomial size and depth O(log i n) AC i : Similar, but unbounded fan-in circuits NC 0 and AC 0 : constant depth circuits NC 0 output depends on only a constant number of input bits 4
23 NC i and AC i NC i : class of languages decided by bounded fan-in logspace-uniform circuits of polynomial size and depth O(log i n) AC i : Similar, but unbounded fan-in circuits NC 0 and AC 0 : constant depth circuits NC 0 output depends on only a constant number of input bits NC 0 AC 0 : Consider L = {1,11,111,...} 4
24 NC and AC 5
25 NC and AC NC = i>0 NC i. Similarly AC. 5
26 NC and AC NC = i>0 NC i. Similarly AC. NC i AC i NC i+1 5
27 NC and AC NC = i>0 NC i. Similarly AC. NC i AC i NC i+1 Clearly NC i AC i 5
28 NC and AC NC = i>0 NC i. Similarly AC. NC i AC i NC i+1 Clearly NC i AC i AC i NC i+1 because polynomial fan-in can be reduced to constant fan-in by using a log depth tree 5
29 NC and AC NC = i>0 NC i. Similarly AC. NC i AC i NC i+1 Clearly NC i AC i AC i NC i+1 because polynomial fan-in can be reduced to constant fan-in by using a log depth tree So NC = AC 5
30 NC P 6
31 NC P Generate circuit of the right input size and evaluate on input 6
32 NC P Generate circuit of the right input size and evaluate on input Generating the circuit 6
33 NC P Generate circuit of the right input size and evaluate on input Generating the circuit in logspace, so poly time; also circuit size is poly 6
34 NC P Generate circuit of the right input size and evaluate on input Generating the circuit in logspace, so poly time; also circuit size is poly Evaluating the gates 6
35 NC P Generate circuit of the right input size and evaluate on input Generating the circuit in logspace, so poly time; also circuit size is poly Evaluating the gates Poly(n) gates 6
36 NC P Generate circuit of the right input size and evaluate on input Generating the circuit in logspace, so poly time; also circuit size is poly Evaluating the gates Poly(n) gates Per gate takes O(1) time + time to look up output values of (already evaluated) gates 6
37 NC P Generate circuit of the right input size and evaluate on input Generating the circuit in logspace, so poly time; also circuit size is poly Evaluating the gates Poly(n) gates Per gate takes O(1) time + time to look up output values of (already evaluated) gates Open problem: Is NC = P? 6
38 Motivation for NC 7
39 Motivation for NC Fast parallel computation is (loosely) modeled as having poly many processors and taking poly-log time 7
40 Motivation for NC Fast parallel computation is (loosely) modeled as having poly many processors and taking poly-log time Corresponds to NC (How?) 7
41 Motivation for NC Fast parallel computation is (loosely) modeled as having poly many processors and taking poly-log time Corresponds to NC (How?) Depth translates to time 7
42 Motivation for NC Fast parallel computation is (loosely) modeled as having poly many processors and taking poly-log time Corresponds to NC (How?) Depth translates to time Total work is size of the circuit 7
43 An example 8
44 An example PARITY in NC 1 8
45 An example PARITY in NC 1 PARITY = { x x has odd number of 1s } 8
46 An example PARITY in NC 1 PARITY = { x x has odd number of 1s } Circuit should evaluate x 1 x 2... xn 8
47 An example PARITY in NC 1 PARITY = { x x has odd number of 1s } Circuit should evaluate x 1 x 2... xn Tree of n-1 XOR gates: log n deep 8
48 An example PARITY in NC 1 PARITY = { x x has odd number of 1s } Circuit should evaluate x 1 x 2... xn Tree of n-1 XOR gates: log n deep Each XOR gate implemented in depth 3 8
49 An example PARITY in NC 1 PARITY = { x x has odd number of 1s } Circuit should evaluate x 1 x 2... xn Tree of n-1 XOR gates: log n deep Each XOR gate implemented in depth 3 8
50 Another example 9
51 Another example PATH AC 1 9
52 Another example PATH AC 1 Boolean Matrix Multiplication 9
53 Another example PATH AC 1 Boolean Matrix Multiplication Z=XY: z ij = k=1..n (x ik y kj ) 9
54 Another example PATH AC 1 Boolean Matrix Multiplication Z=XY: z ij = k=1..n (x ik y kj ) AC 0 circuit (OR gate with fan-in n, AND gates) 9
55 Another example PATH AC 1 Boolean Matrix Multiplication Z=XY: z ij = k=1..n (x ik y kj ) AC 0 circuit (OR gate with fan-in n, AND gates) If X adjacency matrix (with self-loops), X t ij=1 iff path from i to j of length t or less 9
56 Another example PATH AC 1 Boolean Matrix Multiplication Z=XY: z ij = k=1..n (x ik y kj ) AC 0 circuit (OR gate with fan-in n, AND gates) If X adjacency matrix (with self-loops), X t ij=1 iff path from i to j of length t or less X m ij for m n is the transitive closure 9
57 Another example PATH AC 1 Boolean Matrix Multiplication Z=XY: z ij = k=1..n (x ik y kj ) AC 0 circuit (OR gate with fan-in n, AND gates) If X adjacency matrix (with self-loops), X t ij=1 iff path from i to j of length t or less X m ij for m n is the transitive closure O(log n) matrix multiplications to compute X n ij 9
58 Another example PATH AC 1 Boolean Matrix Multiplication Z=XY: z ij = k=1..n (x ik y kj ) AC 0 circuit (OR gate with fan-in n, AND gates) If X adjacency matrix (with self-loops), X t ij=1 iff path from i to j of length t or less X m ij for m n is the transitive closure O(log n) matrix multiplications to compute X n ij Total depth O(log n) 9
59 NC 1 L 10
60 NC 1 L Generate circuit (implicitly) and evaluate 10
61 NC 1 L Generate circuit (implicitly) and evaluate cf. NC P. But now, to conserve space, a recursive evaluation (rather than bottom-up). 10
62 NC 1 L Generate circuit (implicitly) and evaluate cf. NC P. But now, to conserve space, a recursive evaluation (rather than bottom-up). For each gate, recursively evaluate each input wire 10
63 NC 1 L Generate circuit (implicitly) and evaluate cf. NC P. But now, to conserve space, a recursive evaluation (rather than bottom-up). For each gate, recursively evaluate each input wire Storage: A path to the current node, from the output node: since bounded fan-in, takes O(1) bits per node; since logspace uniform that is sufficient to compute the node id in logspace 10
64 NC 1 L Generate circuit (implicitly) and evaluate cf. NC P. But now, to conserve space, a recursive evaluation (rather than bottom-up). For each gate, recursively evaluate each input wire Storage: A path to the current node, from the output node: since bounded fan-in, takes O(1) bits per node; since logspace uniform that is sufficient to compute the node id in logspace And at each node along the path, the input wire values evaluated results so far (again O(1) bits per node) 10
65 NC 1 L Generate circuit (implicitly) and evaluate cf. NC P. But now, to conserve space, a recursive evaluation (rather than bottom-up). For each gate, recursively evaluate each input wire Storage: A path to the current node, from the output node: since bounded fan-in, takes O(1) bits per node; since logspace uniform that is sufficient to compute the node id in logspace And at each node along the path, the input wire values evaluated results so far (again O(1) bits per node) Length of path = depth of circuit = O(log n) 10
66 NL AC 1 11
67 NL AC 1 Recall PATH AC 1 11
68 NL AC 1 Recall PATH AC 1 Also recall PATH is NL-complete 11
69 NL AC 1 Recall PATH AC 1 Also recall PATH is NL-complete with respect to log-space reductions 11
70 NL AC 1 Recall PATH AC 1 Also recall PATH is NL-complete with respect to log-space reductions in fact, with respect to NC 1 reductions 11
71 NL AC 1 Recall PATH AC 1 Also recall PATH is NL-complete with respect to log-space reductions in fact, with respect to NC 1 reductions Exercise! (For NL machine M, can build (in log-space) NC 1 circuit which on input x, outputs (i,j) th entry of the adjacency matrix of configuration graph of M(x).) 11
72 NL AC 1 Recall PATH AC 1 Also recall PATH is NL-complete with respect to log-space reductions in fact, with respect to NC 1 reductions Exercise! (For NL machine M, can build (in log-space) NC 1 circuit which on input x, outputs (i,j) th entry of the adjacency matrix of configuration graph of M(x).) Combining the NC 1 circuits for reduction and the AC 1 circuit for PATH, we get an AC 1 circuit 11
73 Summary: NC i and AC i 12
74 Summary: NC i and AC i NC i AC i NC i+1 NC = AC P 12
75 Summary: NC i and AC i NC i AC i NC i+1 NC = AC P NC 0 AC 0 NC 1 L NL AC 1 12
76 Summary: NC i and AC i NC i AC i NC i+1 NC = AC P NC 0 AC 0 NC 1 L NL AC 1 AC 0 NC 1 as PARITY AC 0 (later) 12
77 Summary: NC i and AC i NC i AC i NC i+1 NC = AC P NC 0 AC 0 NC 1 L NL AC 1 AC 0 NC 1 as PARITY AC 0 (later) Open: whether NC i AC i NC i+1 for larger i 12
78 Summary: NC i and AC i NC i AC i NC i+1 NC = AC P NC 0 AC 0 NC 1 L NL AC 1 AC 0 NC 1 as PARITY AC 0 (later) Open: whether NC i AC i NC i+1 for larger i Open: Is NC = P? (Can all polynomial time decidable languages be sped up to poly-log time using parallelization?) 12
79 Zoo NEXP EXP NP Σ k P PH PSPACE NPSPACE P NC AC AC K NC K AC K-1 NL AC 1 L NC 1 AC 0 NC 0 13
80 DC Uniform 14
81 DC Uniform Recall Uniform circuit family: circuits in the family can be generated by a TM 14
82 DC Uniform Recall Uniform circuit family: circuits in the family can be generated by a TM Suppose circuits are super-polynomially large. Cannot be logspace-uniform or P-uniform. 14
83 DC Uniform Recall Uniform circuit family: circuits in the family can be generated by a TM Suppose circuits are super-polynomially large. Cannot be logspace-uniform or P-uniform. DC uniform allows exponentially large circuits 14
84 DC Uniform Recall Uniform circuit family: circuits in the family can be generated by a TM Suppose circuits are super-polynomially large. Cannot be logspace-uniform or P-uniform. DC uniform allows exponentially large circuits Still requires polynomial time implicit computation of the circuit 14
85 DC Uniform Recall Uniform circuit family: circuits in the family can be generated by a TM Suppose circuits are super-polynomially large. Cannot be logspace-uniform or P-uniform. DC uniform allows exponentially large circuits Still requires polynomial time implicit computation of the circuit Coincides with EXP (Why?) 14
86 O(1) depth DC Uniform 15
87 O(1) depth DC Uniform Restricted to depth k, 2 poly(n) size, unbounded fan-in DC uniform circuit families decide exactly languages in Σ k P Π k P 15
88 O(1) depth DC Uniform Restricted to depth k, 2 poly(n) size, unbounded fan-in DC uniform circuit families decide exactly languages in Σ k P Π k P Given a DC uniform circuit (w.l.o.g alternating levels of AND and OR gates, and NOT gates only at the input level) of depth k, an equivalent quantified expression with k alternations 15
89 O(1) depth DC Uniform Restricted to depth k, 2 poly(n) size, unbounded fan-in DC uniform circuit families decide exactly languages in Σ k P Π k P Given a DC uniform circuit (w.l.o.g alternating levels of AND and OR gates, and NOT gates only at the input level) of depth k, an equivalent quantified expression with k alternations Given a quantified expression with k alternations, an equivalent DC uniform circuit of depth k 15
90 O(1) depth DC Uniform 16
91 O(1) depth DC Uniform From circuit to quantified expression 16
92 O(1) depth DC Uniform From circuit to quantified expression Consider game played on the circuit: adversary picks an edge going into the AND level and Alice picks an edge going into the OR level, going through levels top to bottom 16
93 O(1) depth DC Uniform From circuit to quantified expression Consider game played on the circuit: adversary picks an edge going into the AND level and Alice picks an edge going into the OR level, going through levels top to bottom Alice wins if adversary breaks off the path (by picking either a non-wire edge or a wire not continuing the path), or if the path terminates at literal of value 1 (w/o breaking) 16
94 O(1) depth DC Uniform From circuit to quantified expression Can check in poly time Consider game played on the circuit: adversary picks an edge going into the AND level and Alice picks an edge going into the OR level, going through levels top to bottom Alice wins if adversary breaks off the path (by picking either a non-wire edge or a wire not continuing the path), or if the path terminates at literal of value 1 (w/o breaking) 16
95 O(1) depth DC Uniform From circuit to quantified expression Can check in poly time Consider game played on the circuit: adversary picks an edge going into the AND level and Alice picks an edge going into the OR level, going through levels top to bottom Alice wins if adversary breaks off the path (by picking either a non-wire edge or a wire not continuing the path), or if the path terminates at literal of value 1 (w/o breaking) Input accepted by the circuit iff Alice has a winning strategy (i.e., if the quantified expression is true) 16
96 O(1) depth DC Uniform From circuit to quantified expression Can check in poly time Consider game played on the circuit: adversary picks an edge going into the AND level and Alice picks an edge going into the OR level, going through levels top to bottom Alice wins if adversary breaks off the path (by picking either a non-wire edge or a wire not continuing the path), or if the path terminates at literal of value 1 (w/o breaking) Input accepted by the circuit iff Alice has a winning strategy (i.e., if the quantified expression is true) Each edge has a polynomially long label, and quantified variables take values from the same domain. Checking if edge is a correct wire in poly time (uniformity) 16
97 O(1) depth DC Uniform 17
98 O(1) depth DC Uniform From quantified expression to circuit: 17
99 O(1) depth DC Uniform From quantified expression to circuit: Circuit has sub-circuits evaluating the poly-time condition for each possible assignment of the quantified variables. 17
100 O(1) depth DC Uniform From quantified expression to circuit: Circuit has sub-circuits evaluating the poly-time condition for each possible assignment of the quantified variables. Hang these sub-circuits at the leaves of a k-level AND-OR tree appropriately 17
101 O(1) depth DC Uniform From quantified expression to circuit: Circuit has sub-circuits evaluating the poly-time condition for each possible assignment of the quantified variables. Hang these sub-circuits at the leaves of a k-level AND-OR tree appropriately Circuit can be implicitly computed in polynomial time. Size 2O(total length of variables) 17
102 Today P NC AC AC K NC K AC K-1 L NL NC 1 NC 0 AC 1 AC 0 18
103 NC i and AC i Today P NC AC AC K NC K AC K-1 L NL NC 1 NC 0 AC 1 AC 0 18
104 Today NC i and AC i DC-uniform P NC AC AC K NC K AC K-1 NL AC 1 L NC 1 AC 0 NC 0 18
105 Today NC i and AC i DC-uniform P NC AC PH levels and EXP AC K NC K AC K-1 NL AC 1 L NC 1 AC 0 NC 0 18
106 Today NC i and AC i DC-uniform P NC AC PH levels and EXP Later, more circuits and non-uniform computation (time permitting) L NL AC K NC K AC K-1 AC 1 NC 1 NC 0 AC 0 18
107 Today NC i and AC i DC-uniform P NC AC PH levels and EXP Later, more circuits and non-uniform computation (time permitting) PARITY AC 0 L NL AC K NC K AC K-1 AC 1 NC 1 NC 0 AC 0 18
108 Today NC i and AC i DC-uniform P NC AC PH levels and EXP Later, more circuits and non-uniform computation (time permitting) PARITY AC 0 Decision trees, Branching programs L NL AC K NC K AC K-1 AC 1 NC 1 AC 0 NC 0 18
109 Today NC i and AC i DC-uniform P NC AC PH levels and EXP Later, more circuits and non-uniform computation (time permitting) PARITY AC 0 Decision trees, Branching programs Connections between circuit lowerbounds and other complexity class separations L NL AC K NC K AC K-1 AC 1 NC 1 AC 0 NC 0 18
CS151 Complexity Theory
Introduction CS151 Complexity Theory Lecture 5 April 13, 2004 Power from an unexpected source? we know PEXP, which implies no polytime algorithm for Succinct CVAL poly-size Boolean circuits for Succinct
Complete 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
Lecture 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
1 Circuit Complexity. CS 6743 Lecture 15 1 Fall Definitions
CS 6743 Lecture 15 1 Fall 2007 1 Circuit Complexity 1.1 Definitions A Boolean circuit C on n inputs x 1,..., x n is a directed acyclic graph (DAG) with n nodes of in-degree 0 (the inputs x 1,..., x n ),
Lecture 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
Definition: Alternating time and space Game Semantics: State of machine determines who
CMPSCI 601: Recall From Last Time Lecture Definition: Alternating time and space Game Semantics: State of machine determines who controls, White wants it to accept, Black wants it to reject. White wins
Lecture 4. 1 Circuit Complexity. Notes on Complexity Theory: Fall 2005 Last updated: September, Jonathan Katz
Notes on Complexity Theory: Fall 2005 Last updated: September, 2005 Jonathan Katz Lecture 4 1 Circuit Complexity Circuits are directed, acyclic graphs where nodes are called gates and edges are called
Definition: Alternating time and space Game Semantics: State of machine determines who
CMPSCI 601: Recall From Last Time Lecture 3 Definition: Alternating time and space Game Semantics: State of machine determines who controls, White wants it to accept, Black wants it to reject. White wins
Computational 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
Notes on Computer Theory Last updated: November, Circuits
Notes on Computer Theory Last updated: November, 2015 Circuits Notes by Jonathan Katz, lightly edited by Dov Gordon. 1 Circuits Boolean circuits offer an alternate model of computation: a non-uniform one
Umans Complexity Theory Lectures
Umans Complexity Theory Lectures Lecture 8: Introduction to Randomized Complexity: - Randomized complexity classes, - Error reduction, - in P/poly - Reingold s Undirected Graph Reachability in RL Randomized
Umans Complexity Theory Lectures
Umans Complexity Theory Lectures Lecture 12: The Polynomial-Time Hierarchy Oracle Turing Machines Oracle Turing Machine (OTM): Deterministic multitape TM M with special query tape special states q?, q
Lecture 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,
Lecture 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
Foundations of Query Languages
Foundations of Query Languages SS 2011 2. 2. Foundations of Query Languages Dr. Fang Wei Lehrstuhl für Datenbanken und Informationssysteme Universität Freiburg SS 2011 Dr. Fang Wei 30. Mai 2011 Seite 1
Notes 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
Lecture 11: Proofs, Games, and Alternation
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 11: Proofs, Games, and Alternation David Mix Barrington and Alexis Maciel July 31, 2000
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
Lecture 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
Notes 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
CSE200: 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
Polynomial 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
SOLUTION: 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
9. PSPACE 9. PSPACE. PSPACE complexity class quantified satisfiability planning problem PSPACE-complete
Geography game Geography. Alice names capital city c of country she is in. Bob names a capital city c' that starts with the letter on which c ends. Alice and Bob repeat this game until one player is unable
1 Locally computable randomized encodings
CSG399: Gems of Theoretical Computer Science Lectures 3-4 Feb 20-24, 2009 Instructor: Emanuele Viola Scribe: Eric Miles Cryptography in constant depth: II & III Locally computable randomized encodings
9. PSPACE. PSPACE complexity class quantified satisfiability planning problem PSPACE-complete
9. PSPACE PSPACE complexity class quantified satisfiability planning problem PSPACE-complete Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison Wesley Copyright 2013 Kevin Wayne http://www.cs.princeton.edu/~wayne/kleinberg-tardos
Complexity 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
Parallelism and Machine Models
Parallelism and Machine Models Andrew D Smith University of New Brunswick, Fredericton Faculty of Computer Science Overview Part 1: The Parallel Computation Thesis Part 2: Parallelism of Arithmetic RAMs
Lecture 10: Boolean Circuits (cont.)
CSE 200 Computability and Complexity Wednesday, May, 203 Lecture 0: Boolean Circuits (cont.) Instructor: Professor Shachar Lovett Scribe: Dongcai Shen Recap Definition (Boolean circuit) A Boolean circuit
Space 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
Lecture 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:
Chapter 9. PSPACE: A Class of Problems Beyond NP. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved.
Chapter 9 PSPACE: A Class of Problems Beyond NP Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 Geography Game Geography. Alice names capital city c of country she
CS256 Applied Theory of Computation
CS256 Applied Theory of Computation Compleity Classes III John E Savage Overview Last lecture on time-bounded compleity classes Today we eamine space-bounded compleity classes We prove Savitch s Theorem,
CSC 5170: Theory of Computational Complexity Lecture 4 The Chinese University of Hong Kong 1 February 2010
CSC 5170: Theory of Computational Complexity Lecture 4 The Chinese University of Hong Kong 1 February 2010 Computational complexity studies the amount of resources necessary to perform given computations.
Lecture 9: PSPACE. PSPACE = DSPACE[n O(1) ] = NSPACE[n O(1) ] = ATIME[n O(1) ]
![Lecture 9: PSPACE. PSPACE = DSPACE[n O(1) ] = NSPACE[n O(1) ] = ATIME[n O(1) ]](/thumbs/94/120801112.jpg "Lecture 9: PSPACE. PSPACE = DSPACE[n O(1) ] = NSPACE[n O(1) ] = ATIME[n O(1) ]")
Lecture 9: PSPACE PSPACE = DSPACE[n O(1) ] = NSPACE[n O(1) ] = ATIME[n O(1) ] PSPACE consists of what we could compute with a feasible amount of hardware, but with no time limit. PSPACE is a large and
CS151 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?
1 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
Umans Complexity Theory Lectures
Complexity Theory Umans Complexity Theory Lectures Lecture 1a: Problems and Languages Classify problems according to the computational resources required running time storage space parallelism randomness
Complexity 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,
Computability and Complexity Theory: An Introduction
Computability and Complexity Theory: An Introduction meena@imsc.res.in http://www.imsc.res.in/ meena IMI-IISc, 20 July 2006 p. 1 Understanding Computation Kinds of questions we seek answers to: Is a given
Technische 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
Answers to the CSCE 551 Final Exam, April 30, 2008
Answers to the CSCE 55 Final Exam, April 3, 28. (5 points) Use the Pumping Lemma to show that the language L = {x {, } the number of s and s in x differ (in either direction) by at most 28} is not regular.
Notes 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
Complexity 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))
Lecture 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
De 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
satisfiability (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
2 Natural Proofs: a barrier for proving circuit lower bounds
Topics in Theoretical Computer Science April 4, 2016 Lecturer: Ola Svensson Lecture 6 (Notes) Scribes: Ola Svensson Disclaimer: These notes were written for the lecturer only and may contain inconsistent
Lecture 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
DRAFT. Algebraic computation models. Chapter 14
Chapter 14 Algebraic computation models Somewhat rough We think of numerical algorithms root-finding, gaussian elimination etc. as operating over R or C, even though the underlying representation of the
Reductions to Graph Isomorphism
Reductions to raph Isomorphism Jacobo Torán Institut für Theoretische Informatik Universität Ulm D-89069 Ulm, ermany jacobo.toran@uni-ulm.de June 13, 2008 Keywords: Computational complexity, reducibilities,
Lecture 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
The 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
CMPT 710/407 - Complexity Theory Lecture 4: Complexity Classes, Completeness, Linear Speedup, and Hierarchy Theorems
CMPT 710/407 - Complexity Theory Lecture 4: Complexity Classes, Completeness, Linear Speedup, and Hierarchy Theorems Valentine Kabanets September 13, 2007 1 Complexity Classes Unless explicitly stated,
Logarithmic space. Evgenij Thorstensen V18. Evgenij Thorstensen Logarithmic space V18 1 / 18
Logarithmic space Evgenij Thorstensen V18 Evgenij Thorstensen Logarithmic space V18 1 / 18 Journey below Unlike for time, it makes sense to talk about sublinear space. This models computations on input
CS151 Complexity Theory. Lecture 1 April 3, 2017
CS151 Complexity Theory Lecture 1 April 3, 2017 Complexity Theory Classify problems according to the computational resources required running time storage space parallelism randomness rounds of interaction,
Space 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
: On the P vs. BPP problem. 18/12/16 Lecture 10
03684155: On the P vs. BPP problem. 18/12/16 Lecture 10 Natural proofs Amnon Ta-Shma and Dean Doron 1 Natural proofs The ultimate goal we have is separating classes (or proving they are equal if they are).
Lecture 2. 1 More N P-Compete Languages. Notes on Complexity Theory: Fall 2005 Last updated: September, Jonathan Katz
Notes on Complexity Theory: Fall 2005 Last updated: September, 2005 Jonathan Katz Lecture 2 1 More N P-Compete Languages It will be nice to find more natural N P-complete languages. To that end, we ine
CS151 Complexity Theory. Lecture 14 May 17, 2017
CS151 Complexity Theory Lecture 14 May 17, 2017 IP = PSPACE Theorem: (Shamir) IP = PSPACE Note: IP PSPACE enumerate all possible interactions, explicitly calculate acceptance probability interaction extremely
Lecture 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
INAPPROX 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/ε
Computability 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
Lecture 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
Lecture 21: Algebraic Computation Models
princeton university cos 522: computational complexity Lecture 21: Algebraic Computation Models Lecturer: Sanjeev Arora Scribe:Loukas Georgiadis We think of numerical algorithms root-finding, gaussian
CS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games
CS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games Scribe: Zeyu Guo In the first lecture, we saw three equivalent variants of the classical PCP theorems in terms of CSP, proof checking,
Time and space classes Little Oh (o, CS 580: Algorithm Design and Analysis. Jeremiah Blocki Purdue University Spring 2018
CS 580: Algorithm Design and Analysis Jeremiah Blocki Purdue University Spring 2018 Chapter 9 PSPACE: A Class of Problems Beyond NP Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights
CS6840: Advanced Complexity Theory Mar 29, Lecturer: Jayalal Sarma M.N. Scribe: Dinesh K.
CS684: Advanced Complexity Theory Mar 29, 22 Lecture 46 : Size lower bounds for AC circuits computing Parity Lecturer: Jayalal Sarma M.N. Scribe: Dinesh K. Theme: Circuit Complexity Lecture Plan: Proof
JASS 06 Report Summary. Circuit Complexity. Konstantin S. Ushakov. May 14, 2006
JASS 06 Report Summary Circuit Complexity Konstantin S. Ushakov May 14, 2006 Abstract Computer science deals with many computational models. In real life we have normal computers that are constructed using,
Complexity 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
Outline. 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
Lecture 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
Introduction 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
Lecture #14: NP-Completeness (Chapter 34 Old Edition Chapter 36) Discussion here is from the old edition.
Lecture #14: 0.0.1 NP-Completeness (Chapter 34 Old Edition Chapter 36) Discussion here is from the old edition. 0.0.2 Preliminaries: Definition 1 n abstract problem Q is a binary relations on a set I of
UC Berkeley CS 170: Efficient Algorithms and Intractable Problems Handout 22 Lecturer: David Wagner April 24, Notes 22 for CS 170
UC Berkeley CS 170: Efficient Algorithms and Intractable Problems Handout 22 Lecturer: David Wagner April 24, 2003 Notes 22 for CS 170 1 NP-completeness of Circuit-SAT We will prove that the circuit satisfiability
Lecture 8: Alternatation. 1 Alternate Characterizations of the Polynomial Hierarchy
CS 710: Complexity Theory 10/4/2011 Lecture 8: Alternatation Instructor: Dieter van Melkebeek Scribe: Sachin Ravi In this lecture, we continue with our discussion of the polynomial hierarchy complexity
P = 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,
CSCI 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
CS151 Complexity Theory. Lecture 13 May 15, 2017
CS151 Complexity Theory Lecture 13 May 15, 2017 Relationship to other classes To compare to classes of decision problems, usually consider P #P which is a decision class easy: NP, conp P #P easy: P #P
1 AC 0 and Håstad Switching Lemma
princeton university cos 522: computational complexity Lecture 19: Circuit complexity Lecturer: Sanjeev Arora Scribe:Tony Wirth Complexity theory s Waterloo As we saw in an earlier lecture, if PH Σ P 2
Lecture 10: Learning DNF, AC 0, Juntas. 1 Learning DNF in Almost Polynomial Time
Analysis of Boolean Functions (CMU 8-859S, Spring 2007) Lecture 0: Learning DNF, AC 0, Juntas Feb 5, 2007 Lecturer: Ryan O Donnell Scribe: Elaine Shi Learning DNF in Almost Polynomial Time From previous
6.842 Randomness and Computation April 2, Lecture 14
6.84 Randomness and Computation April, 0 Lecture 4 Lecturer: Ronitt Rubinfeld Scribe: Aaron Sidford Review In the last class we saw an algorithm to learn a function where very little of the Fourier coeffecient
Chapter 2. Reductions and NP. 2.1 Reductions Continued The Satisfiability Problem (SAT) SAT 3SAT. CS 573: Algorithms, Fall 2013 August 29, 2013
Chapter 2 Reductions and NP CS 573: Algorithms, Fall 2013 August 29, 2013 2.1 Reductions Continued 2.1.1 The Satisfiability Problem SAT 2.1.1.1 Propositional Formulas Definition 2.1.1. Consider a set of
CSCE 551 Final Exam, April 28, 2016 Answer Key
CSCE 551 Final Exam, April 28, 2016 Answer Key 1. (15 points) Fix any alphabet Σ containing the symbol a. For any language L Σ, define the language a\l := {w Σ wa L}. Show that if L is regular, then a\l
Lecture 22: Counting
CS 710: Complexity Theory 4/8/2010 Lecture 22: Counting Instructor: Dieter van Melkebeek Scribe: Phil Rydzewski & Chi Man Liu Last time we introduced extractors and discussed two methods to construct them.
Lecture 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
MACHINE COMPUTING. the limitations
MACHINE COMPUTING the limitations human computing stealing brain cycles of the masses word recognition: to digitize all printed writing language education: to translate web content games with a purpose
CSCI 1590 Intro to Computational Complexity
CSCI 59 Intro to Computational Complexity Overview of the Course John E. Savage Brown University January 2, 29 John E. Savage (Brown University) CSCI 59 Intro to Computational Complexity January 2, 29
CSE 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
CS21 Decidability and Tractability
CS21 Decidability and Tractability Lecture 20 February 23, 2018 February 23, 2018 CS21 Lecture 20 1 Outline the complexity class NP NP-complete probelems: Subset Sum NP-complete problems: NAE-3-SAT, max
6.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
1 Deterministic Turing Machines
Time and Space Classes Exposition by William Gasarch 1 Deterministic Turing Machines Turing machines are a model of computation. It is believed that anything that can be computed can be computed by a Turing
1 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
A.Antonopoulos 18/1/2010
Class DP Basic orems 18/1/2010 Class DP Basic orems 1 Class DP 2 Basic orems Class DP Basic orems TSP Versions 1 TSP (D) 2 EXACT TSP 3 TSP COST 4 TSP (1) P (2) P (3) P (4) DP Class Class DP Basic orems
POLYNOMIAL 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
Time 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
CSC 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
6.045: Automata, Computability, and Complexity (GITCS) Class 15 Nancy Lynch
6.045: Automata, Computability, and Complexity (GITCS) Class 15 Nancy Lynch Today: More Complexity Theory Polynomial-time reducibility, NP-completeness, and the Satisfiability (SAT) problem Topics: Introduction
CS 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