Homomorphism Testing
|
|
- Dustin Day
- 5 years ago
- Views:
Transcription
1 Homomorphism Shpilka & Wigderson, 2006 Daniel Shahaf Tel-Aviv University January 2009
2 Table of Contents / 26
3 Algebra Definitions 1 Algebra Definitions 2 / 26
4 Groups Algebra Definitions Definition A group is a set G and a binary function + : G 2 G such that + has identity: g + 0 = 0 + g = g. inverses: g + g = g + g = 0. associativity: (g + g ) + g = g + (g + g ). If + is commutative, then (G, +) is called Abelian. 3 / 26
5 Groups Algebra Definitions Definition A group is a set G and a binary function + : G 2 G such that + has identity: g + 0 = 0 + g = g. inverses: g + g = g + g = 0. associativity: (g + g ) + g = g + (g + g ). If + is commutative, then (G, +) is called Abelian. Notational convention In this work, G is a group written additively and H is a group written multiplicatively. 3 / 26
6 (Affine) Homomorphisms Algebra Definitions Definition A homomorphism from a group G to a group H is a function f : G H such that f (g 1 ) f (g 2 ) = f (g 1 + g 2 ) for any g 1, g 2 G. Definition If f = h f and f Hom(G, H ), then f is an affine homomorphism. Is f h necessarily an affine homomorphism? 4 / 26
7 (Affine) Homomorphisms Algebra Definitions Definition A homomorphism from a group G to a group H is a function f : G H such that f (g 1 ) f (g 2 ) = f (g 1 + g 2 ) for any g 1, g 2 G. Definition If f = h f and f Hom(G, H ), then f is an affine homomorphism. Is f h necessarily an affine homomorphism? Lemma (Exercise) A function f is an affine homomorphism the function f := x f (0) 1 f (x) is a homomorphism. 4 / 26
8 Distances Algebra Definitions Definition The (normalized) Hamming distance of two functions f, g : D R is the fraction of D on which they disagree: dist(f, g) := Prob [f (x) g(x)]. x D Definition We say that a function f : G H is ɛ-close to linearity if dist(f, Hom(G, H )) ɛ. Otherwise f is said to be ɛ-far. 5 / 26
9 Motivation Formalization Past Answers 2 Motivation Formalization Past Answers 6 / 26
10 Linear Functions Motivation Formalization Past Answers Many problems can be presented or solved in terms of questions about functions and linearity: Numerical computations. The PCP theorem. Dictator functions. 7 / 26
11 Linear Functions Motivation Formalization Past Answers Many problems can be presented or solved in terms of questions about functions and linearity: Numerical computations. The PCP theorem. Dictator functions. Questions Is this function linear? How little need I change this function to make it linear? How do I change this function to make it linear? 7 / 26
12 Defining Motivation Formalization Past Answers Question Given a function f : G H, is f a homomorphism, or ɛ-far from linearity? 8 / 26
13 Defining Motivation Formalization Past Answers Question Given a function f : G H, is f a homomorphism, or ɛ-far from linearity? Yet another gap problem. Oracle-access model. 8 / 26
14 Defining The Solutions Motivation Formalization Past Answers We will seek probabilistic tests that classify functions with high accuracy. The tests will accept all valid inputs with probability 1. Need to show that they reject invalid (ɛ-far) inputs with high probability. 9 / 26
15 Defining The Solutions Motivation Formalization Past Answers We will seek probabilistic tests that classify functions with high accuracy. The tests will accept all valid inputs with probability 1. Need to show that they reject invalid (ɛ-far) inputs with high probability. A (δ, ɛ)-test for a property P D is a algorithm(d) that, on input that is ɛ-far from having P, accepts with probability at most δ. 9 / 26
16 Defining The Solutions Motivation Formalization Past Answers We will seek probabilistic tests that classify functions with high accuracy. The tests will accept all valid inputs with probability 1. Need to show that they reject invalid (ɛ-far) inputs with high probability. A (δ, ɛ)-test for a property P D is a algorithm(d) that, on input that is ɛ-far from having P, accepts with probability at most δ. Properties of tests Query complexity. Probability distance relation. Asymptotical running time. Number of random bits. 9 / 26
17 The BLR Test Motivation Formalization Past Answers test Pick at random x, y G. Accept iff f (x) f (y) = f (x + y). 10 / 26
18 The BLR Test Motivation Formalization Past Answers test Pick at random x, y G. Accept iff f (x) f (y) = f (x + y). If f Hom(G, H ), the test passes with probability 1. If the test passes with high probability, then f is ɛ-close. The BLR test is a (δ, δ/3 + O(δ 2 )) test. }{{} ɛ 10 / 26
19 The BLR Test Motivation Formalization Past Answers test Pick at random x, y G. Accept iff f (x) f (y) = f (x + y). If f Hom(G, H ), the test passes with probability 1. If the test passes with high probability, then f is ɛ-close. The BLR test is a (δ, δ/3 + O(δ 2 )) test. }{{} ɛ Exercise Extend the BLR linearity test to affine homomorphisms. 10 / 26
20 Graph Tests Motivation Formalization Past Answers The BLR test picked random x, y G. Generalization (Graph tests) Fix E G 2. E is viewed as a graph over vertices V = G. BLR: E = G 2 Pick random (x, y) E. 11 / 26
21 Graph Tests Motivation Formalization Past Answers The BLR test picked random x, y G. Generalization (Graph tests) Fix E G 2. E is viewed as a graph over vertices V = G. BLR: E = G 2 Pick random (x, y) E. Question Which graphs induce good tests? 11 / 26
22 Good Graphs Motivation Formalization Past Answers Problem: the BLR test requires 2 log G random bits. New goal: minimize randomness. Lower bound: log G + O(1). 12 / 26
23 Good Graphs Motivation Formalization Past Answers Problem: the BLR test requires 2 log G random bits. New goal: minimize randomness. Lower bound: log G + O(1). Idea: use graph tests. The graph test T E (induced by E G) requires only log E random bits. 12 / 26
24 Good Graphs Motivation Formalization Past Answers Problem: the BLR test requires 2 log G random bits. New goal: minimize randomness. Lower bound: log G + O(1). Idea: use graph tests. The graph test T E (induced by E G) requires only log E random bits. Theorem For all but e G -fraction of graphs E sized C G log H, and for every δ > 0, the test T E is a (δ, δ/3 + O(δ 2 ) + e G )-test for linearity. Need log G + log log H + O(1) randomness. Problem: which explicit such graphs are good/bad? 12 / 26
25 Proposed Test 3 Proposed Test 13 / 26
26 Cayley Graphs Proposed Test Let S H be a generating subset. Definition The Cayley graph G = Cay(H ; S) is the graph over vertices H with edges { h, h s h H, s S }. 14 / 26
27 Cayley Graphs Proposed Test Let S H be a generating subset. Definition The Cayley graph G = Cay(H ; S) is the graph over vertices H with edges { h, h s h H, s S }. Properties S -regular. If S is symmetric then G is undirected. G is vertex-transitive: u, v G h u, h v G. G is simple iff 1 / S. 14 / 26
28 Eigenvalues Proposed Test Definition The eigenvalues of a graph G are the eigenvalues of its adjacency matrix (M ij = [ i, j G]). Facts about Cayley graphs The top eigenvalue is λ 1 = d. 15 / 26
29 Eigenvalues Proposed Test Definition The eigenvalues of a graph G are the eigenvalues of its adjacency matrix (M ij = [ i, j G]). Facts about Cayley graphs The top eigenvalue is λ 1 = d. Define the normalized second eigenvalue: then λ 1 (i.e., λ 2 λ 1 ). λ[g] := 1 d max(λ 2, λ n ). If we remove any 2δdn edges from the graph, then remains a connected component of size at least (1 ɛ)n. ɛ := 4δ/ (1 λ[g]) < 1/3. 15 / 26
30 Constructive Tests Proposed Test Definition For G = Cay(G; S), let T G be the test that picks at random an edge x, x + s Cay(G; S) and checks whether f (x) f (s) = f (x + s). 16 / 26
31 Constructive Tests Proposed Test Definition For G = Cay(G; S), let T G be the test that picks at random an edge x, x + s Cay(G; S) and checks whether f (x) f (s) = f (x + s). Theorem For every G, H, and symmetric subset S G, the test T G accepts with probability 1 all homomorphisms h : G H ; where rejects with probability δ any function f : G H which is ɛ-far from being an affine homomorphism; δ := Prob [f (g) f (s) f (g + s)]; ɛ := 4δ/ (1 λ[g]) < 1/3. 16 / 26
32 Extracting a Homomorphism Take f, G, H, S, G, T G, δ, ɛ < 1/3, and λ := λ[g] as before. Denote d := S and n := G. Proposed Test Conclusion If δ ɛ is small, then f is close to an affine homomorphism. 17 / 26
33 Extracting a Homomorphism Proposed Test Take f, G, H, S, G, T G, δ, ɛ < 1/3, and λ := λ[g] as before. Denote d := S and n := G. Overview 1 For every x, almost all y agree on the value of [ ϕ(x) := Plurality f (x + y) f (y) 1 ]. y G 2 ϕ is a homomorphism. 3 ϕ is close to an affine shift of f. Conclusion If δ ɛ is small, then f is close to an affine homomorphism. 17 / 26
34 The Plurality Function I Proposed Test Claim For every x G, [ Prob ϕ(x) = f (x + y) f (y) 1] 1 ɛ. y G Proof go back skip proof 18 / 26
35 The Plurality Function I Proposed Test Claim For every x G, [ Prob ϕ(x) = f (x + y) f (y) 1] 1 ɛ. y G Proof Fix x G. By definition, δ = Prob [f (x + y)f (s) f (x + y + s)]. y G,s S Number of bad edges, y, y + s G having f (y) f (s) f (y + s) or f (x + y)f (s) f (x + y + s), is at most 2δdn. 18 / 26
36 The Plurality Function II Proposed Test Let H x G be obtained by removing all (undirected) bad edges, and let C x H x be a connected component of size (1 ɛ)n. Exists because there are at most 2δdn bad edges. 19 / 26
37 The Plurality Function II Proposed Test Let H x G be obtained by removing all (undirected) bad edges, and let C x H x be a connected component of size (1 ɛ)n. Exists because there are at most 2δdn bad edges. Lemma For any u, v C x, we have f (x + v) f (v) 1 = f (x + u) f (u) 1. Proof Take a path v = v 1,..., v t = u in C x. Write v i+1 = v i, v i + s i. Observe that f (v i ) 1 f (v i+1 ) = f (s i ) = f (x + v i ) 1 f (x + v i+1 ). 19 / 26
38 The Plurality Function III Proposed Test Conclusion Thus, f (x + v) f (v) 1 is constant for v C x. C x (1 ɛ)n > 1 2 G. 20 / 26
39 The Homomorphism I Claim ϕ is a homomorphism. Proposed Test Proof go back skip proof 21 / 26
40 The Homomorphism I Proposed Test Claim ϕ is a homomorphism. Proof Fix x, y G. Define: Then: p := Prob [ϕ(x) ϕ(y) = ϕ(x + y)]. h G A(x, y) := { ϕ(x) = f (y) f ( x + y) 1 }. p { 0, 1 }. p Prob [A(x, x + h) A(y, h) A(x + y, x + h)]. h G 21 / 26
41 The Homomorphism II Proposed Test From Claim 1: Prob [A(x, x + h)] 1 ɛ; h G [ ( )] Prob [A(y, h)] = Prob A y, y + ( y + h) h G h G [ = Prob A(y, y + h ) ] h G 1 ɛ; Prob [A(x + y, x + h)] 1 ɛ. h G 22 / 26
42 The Homomorphism II From Claim 1: Proposed Test Prob [A(x, x + h)] h G Prob [A(y, h)] h G Prob [A(x + y, x + h)] h G 1 ɛ 1 ɛ 1 ɛ Therefore: p Prob h G [A(x, x + h) A(y, h) A(x + y, x + h)]. p 1 3ɛ > / 26
43 The Homomorphism II From Claim 1: Proposed Test Prob [A(x, x + h)] h G Prob [A(y, h)] h G Prob [A(x + y, x + h)] h G 1 ɛ 1 ɛ 1 ɛ Therefore: p Prob [A(x, x + h) A(y, h) A(x + y, x + h)]. h G p 1 3ɛ > 0. p { 0, 1 }. p = 1. ϕ is a homomorphism. 22 / 26
44 The Affine Shift Claim There is some γ H such that dist(ϕ, f γ) ɛ. Proposed Test Proof go back skip proof 23 / 26
45 The Affine Shift Proposed Test Claim There is some γ H such that dist(ϕ, f γ) ɛ. Proof G x,y := { ϕ(x) = f (x + y) f (y) 1 } x. { y : G x,y } C x (1 ɛ) G 23 / 26
46 The Affine Shift Proposed Test Claim There is some γ H such that dist(ϕ, f γ) ɛ. Proof G x,y := { ϕ(x) = f (x + y) f (y) 1 } x. { y : G x,y } C x (1 ɛ) G x. Prob [G x,y ] 1 ɛ y Prob [G x,y] 1 ɛ x,y y 0. Prob [G x,y0 ] 1 ɛ x 23 / 26
47 The Affine Shift Proposed Test Claim There is some γ H such that dist(ϕ, f γ) ɛ. Proof G x,y := { ϕ(x) = f (x + y) f (y) 1 } x. { y : G x,y } C x (1 ɛ) G x. Prob [G x,y ] 1 ɛ y Prob [G x,y] 1 ɛ x,y y 0. Prob [G x,y0 ] 1 ɛ x [ ϕ(x) = f (x + y0 ) f (y 0 ) 1] 1 ɛ Prob x [ Prob ϕ(x + ( y 0 )) = f (x ) f (y 0 ) 1] 1 ɛ x G 23 / 26
48 Extracting a Homomorphism Proposed Test Take f, G, H, S, G, T G, δ, ɛ < 1/3, and λ := λ[g] as before. Denote d := S and n := G. Overview 1 For every x, almost all y agree on the value of [ ϕ(x) := Plurality f (x + y) f (y) 1 ]. y G 2 ϕ is a homomorphism. 3 ϕ is close to an affine shift of f. Conclusion If δ ɛ is small, then f is close to an affine homomorphism. 24 / 26
49 / 26
50 The answer is soup. The End.
Lecture 5: Derandomization (Part II)
CS369E: Expanders May 1, 005 Lecture 5: Derandomization (Part II) Lecturer: Prahladh Harsha Scribe: Adam Barth Today we will use expanders to derandomize the algorithm for linearity test. Before presenting
More informationSymmetric LDPC codes and local testing
Symmetric LDPC codes and local testing Tali Kaufman MIT kaufmant@mit.edu Avi Wigderson Institute for Advanced Study avi@ias.edu December 22, 2009 Abstract Coding theoretic and complexity theoretic considerations
More informationLecture 22. m n c (k) i,j x i x j = c (k) k=1
Notes on Complexity Theory Last updated: June, 2014 Jonathan Katz Lecture 22 1 N P PCP(poly, 1) We show here a probabilistically checkable proof for N P in which the verifier reads only a constant number
More information2 Completing the Hardness of approximation of Set Cover
CSE 533: The PCP Theorem and Hardness of Approximation (Autumn 2005) Lecture 15: Set Cover hardness and testing Long Codes Nov. 21, 2005 Lecturer: Venkat Guruswami Scribe: Atri Rudra 1 Recap We will first
More informationLecture Notes on Linearity (Group Homomorphism) Testing
Lecture Notes on Linearity (Group Homomorphism) Testing Oded Goldreich April 5, 2016 Summary: These notes present a linearity tester that, on input a description of two groups G,H and oracle access to
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 informationLecture 1: 01/22/2014
COMS 6998-3: Sub-Linear Algorithms in Learning and Testing Lecturer: Rocco Servedio Lecture 1: 01/22/2014 Spring 2014 Scribes: Clément Canonne and Richard Stark 1 Today High-level overview Administrative
More informationAlgebraic Constructions of Graphs
Spectral Graph Theory Lecture 15 Algebraic Constructions of Graphs Daniel A. Spielman October 17, 2012 15.1 Overview In this lecture, I will explain how to make graphs from linear error-correcting codes.
More informationCharacterizations of Strongly Regular Graphs: Part II: Bose-Mesner algebras of graphs. Sung Y. Song Iowa State University
Characterizations of Strongly Regular Graphs: Part II: Bose-Mesner algebras of graphs Sung Y. Song Iowa State University sysong@iastate.edu Notation K: one of the fields R or C X: a nonempty finite set
More informationSection 3 Isomorphic Binary Structures
Section 3 Isomorphic Binary Structures Instructor: Yifan Yang Fall 2006 Outline Isomorphic binary structure An illustrative example Definition Examples Structural properties Definition and examples Identity
More informationApproximating MAX-E3LIN is NP-Hard
Approximating MAX-E3LIN is NP-Hard Evan Chen May 4, 2016 This lecture focuses on the MAX-E3LIN problem. We prove that approximating it is NP-hard by a reduction from LABEL-COVER. 1 Introducing MAX-E3LIN
More informationCayley Graphs of Finitely Generated Groups
Cayley Graphs of Finitely Generated Groups Simon Thomas Rutgers University 13th May 2014 Cayley graphs of finitely generated groups Definition Let G be a f.g. group and let S G { 1 } be a finite generating
More informationNotes for Lecture 2. Statement of the PCP Theorem and Constraint Satisfaction
U.C. Berkeley Handout N2 CS294: PCP and Hardness of Approximation January 23, 2006 Professor Luca Trevisan Scribe: Luca Trevisan Notes for Lecture 2 These notes are based on my survey paper [5]. L.T. Statement
More informationReading group: proof of the PCP theorem
Reading group: proof of the PCP theorem 1 The PCP Theorem The usual formulation of the PCP theorem is equivalent to: Theorem 1. There exists a finite constraint language A such that the following problem
More informationCSC 5170: Theory of Computational Complexity Lecture 13 The Chinese University of Hong Kong 19 April 2010
CSC 5170: Theory of Computational Complexity Lecture 13 The Chinese University of Hong Kong 19 April 2010 Recall the definition of probabilistically checkable proofs (PCP) from last time. We say L has
More informationMath 203A - Solution Set 3
Math 03A - Solution Set 3 Problem 1 Which of the following algebraic sets are isomorphic: (i) A 1 (ii) Z(xy) A (iii) Z(x + y ) A (iv) Z(x y 5 ) A (v) Z(y x, z x 3 ) A Answer: We claim that (i) and (v)
More informationCS359G Lecture 5: Characters of Abelian Groups
4/25/2011 CS359G Lecture 5: Characters of Abelia in theory "Marge, I agree with you - in theory. In theory, communism works. In theory." -- Homer Simpson CS359G Lecture 5: Characters of Abelian Groups
More informationMonoids. Definition: A binary operation on a set M is a function : M M M. Examples:
Monoids Definition: A binary operation on a set M is a function : M M M. If : M M M, we say that is well defined on M or equivalently, that M is closed under the operation. Examples: Definition: A monoid
More informationRings, Paths, and Paley Graphs
Spectral Graph Theory Lecture 5 Rings, Paths, and Paley Graphs Daniel A. Spielman September 12, 2012 5.1 About these notes These notes are not necessarily an accurate representation of what happened in
More informationAdvanced Algorithms (XIII) Yijia Chen Fudan University
Advanced Algorithms (XIII) Yijia Chen Fudan University The PCP Theorem Theorem NP = PCP(log n, 1). Motivation Approximate solutions Definition (Approximation of MAX-3SAT) For every 3CNF formula ϕ, the
More informationAUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS
AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize
More informationIntegral Cayley graphs on Sym n and Alt n
Integral Cayley graphs on Sym n and Alt n Elena Konstantinova Sobolev Institute of Mathematics Novosibirsk State University Symmetry vs Regularity Conference in Algebraic Graph Theory July 4, 2018 Pilsen,
More informationChapter 0: Preliminaries
Chapter 0: Preliminaries Adam Sheffer March 28, 2016 1 Notation This chapter briefly surveys some basic concepts and tools that we will use in this class. Graduate students and some undergrads would probably
More informationarxiv: v4 [math.gr] 17 Jun 2015
On finite groups all of whose cubic Cayley graphs are integral arxiv:1409.4939v4 [math.gr] 17 Jun 2015 Xuanlong Ma and Kaishun Wang Sch. Math. Sci. & Lab. Math. Com. Sys., Beijing Normal University, 100875,
More informationLecture 8 (Notes) 1. The book Computational Complexity: A Modern Approach by Sanjeev Arora and Boaz Barak;
Topics in Theoretical Computer Science April 18, 2016 Lecturer: Ola Svensson Lecture 8 (Notes) Scribes: Ola Svensson Disclaimer: These notes were written for the lecturer only and may contain inconsistent
More informationLecture 3: Error Correcting Codes
CS 880: Pseudorandomness and Derandomization 1/30/2013 Lecture 3: Error Correcting Codes Instructors: Holger Dell and Dieter van Melkebeek Scribe: Xi Wu In this lecture we review some background on error
More informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationToday. Few Comments. PCP Theorem, Simple proof due to Irit Dinur [ECCC, TR05-046]! Based on some ideas promoted in [Dinur- Reingold 04].
Today Few Comments PCP Theorem, Simple proof due to Irit Dinur [ECCC, TR05-046]! Based on some ideas promoted in [Dinur- Reingold 04]. Remarkably simple novel proof. Leads to new quantitative results too!
More informationLecture 5: Probabilistic tools and Applications II
T-79.7003: Graphs and Networks Fall 2013 Lecture 5: Probabilistic tools and Applications II Lecturer: Charalampos E. Tsourakakis Oct. 11, 2013 5.1 Overview In the first part of today s lecture we will
More informationALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 4: MORE ABOUT VARIETIES AND REGULAR FUNCTIONS.
ALGERAIC GEOMETRY COURSE NOTES, LECTURE 4: MORE AOUT VARIETIES AND REGULAR FUNCTIONS. ANDREW SALCH. More about some claims from the last lecture. Perhaps you have noticed by now that the Zariski topology
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 informationLecture 15: A Brief Look at PCP
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 15: A Brief Look at PCP David Mix Barrington and Alexis Maciel August 4, 2000 1. Overview
More informationBorel circle squaring
Borel circle squaring Andrew Marks, joint with Spencer Unger UCLA Tarski s circle squaring problem The theory of amenability can be used to show that Lebesgue measure on R 2 can be extended to a finitely
More informationCHEVALLEY S THEOREM AND COMPLETE VARIETIES
CHEVALLEY S THEOREM AND COMPLETE VARIETIES BRIAN OSSERMAN In this note, we introduce the concept which plays the role of compactness for varieties completeness. We prove that completeness can be characterized
More informationLecture 8: Linearity and Assignment Testing
CE 533: The PCP Theorem and Hardness of Approximation (Autumn 2005) Lecture 8: Linearity and Assignment Testing 26 October 2005 Lecturer: Venkat Guruswami cribe: Paul Pham & Venkat Guruswami 1 Recap In
More informationPCPs and Inapproximability Gap-producing and Gap-Preserving Reductions. My T. Thai
PCPs and Inapproximability Gap-producing and Gap-Preserving Reductions My T. Thai 1 1 Hardness of Approximation Consider a maximization problem Π such as MAX-E3SAT. To show that it is NP-hard to approximation
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 informationMa/CS 6b Class 25: Error Correcting Codes 2
Ma/CS 6b Class 25: Error Correcting Codes 2 By Adam Sheffer Recall: Codes V n the set of binary sequences of length n. For example, V 3 = 000,001,010,011,100,101,110,111. Codes of length n are subsets
More information2-GENERATED CAYLEY DIGRAPHS ON NILPOTENT GROUPS HAVE HAMILTONIAN PATHS
Volume 7, Number 1, Pages 41 47 ISSN 1715-0868 2-GENERATED CAYLEY DIGRAPHS ON NILPOTENT GROUPS HAVE HAMILTONIAN PATHS DAVE WITTE MORRIS Abstract. Suppose G is a nilpotent, finite group. We show that if
More information6.842 Randomness and Computation March 3, Lecture 8
6.84 Randomness and Computation March 3, 04 Lecture 8 Lecturer: Ronitt Rubinfeld Scribe: Daniel Grier Useful Linear Algebra Let v = (v, v,..., v n ) be a non-zero n-dimensional row vector and P an n n
More informationLectures 15: Cayley Graphs of Abelian Groups
U.C. Berkeley CS294: Spectral Methods and Expanders Handout 15 Luca Trevisan March 14, 2016 Lectures 15: Cayley Graphs of Abelian Groups In which we show how to find the eigenvalues and eigenvectors of
More informationLecture 3: Boolean Functions and the Walsh Hadamard Code 1
CS-E4550 Advanced Combinatorics in Computer Science Autumn 2016: Selected Topics in Complexity Theory Lecture 3: Boolean Functions and the Walsh Hadamard Code 1 1. Introduction The present lecture develops
More informationEigenvalues, random walks and Ramanujan graphs
Eigenvalues, random walks and Ramanujan graphs David Ellis 1 The Expander Mixing lemma We have seen that a bounded-degree graph is a good edge-expander if and only if if has large spectral gap If G = (V,
More informationQuantum walk algorithms
Quantum walk algorithms Andrew Childs Institute for Quantum Computing University of Waterloo 28 September 2011 Randomized algorithms Randomness is an important tool in computer science Black-box problems
More informationACO Comprehensive Exam March 20 and 21, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms Part a: You are given a graph G = (V,E) with edge weights w(e) > 0 for e E. You are also given a minimum cost spanning tree (MST) T. For one particular edge
More informationInvariance in Property Testing
Invariance in Property Testing Madhu Sudan Microsoft Research Based on: works with/of Eli Ben-Sasson, Elena Grigorescu, Tali Kaufman, Shachar Lovett, Ghid Maatouk, Amir Shpilka. February 22, 2012 Invariance
More informationAdditive Combinatorics Lecture 12
Additive Combinatorics Lecture 12 Leo Goldmakher Scribe: Gal Gross April 4th, 2014 Last lecture we proved the Bohr-to-gAP proposition, but the final step was a bit mysterious we invoked Minkowski s second
More informationPCP Soundness amplification Meeting 2 ITCS, Tsinghua Univesity, Spring April 2009
PCP Soundness amplification Meeting 2 ITCS, Tsinghua Univesity, Spring 2009 29 April 2009 Speaker: Andrej Bogdanov Notes by: Andrej Bogdanov Recall the definition of probabilistically checkable proofs
More informationACTING FREELY GABRIEL GASTER
ACTING FREELY GABRIEL GASTER 1. Preface This article is intended to present a combinatorial proof of Schreier s Theorem, that subgroups of free groups are free. While a one line proof exists using the
More informationDegree of commutativity of infinite groups
Degree of commutativity of infinite groups... or how I learnt about rational growth and ends of groups Motiejus Valiunas University of Southampton Groups St Andrews 2017 11th August 2017 The concept of
More informationOut-colourings of Digraphs
Out-colourings of Digraphs N. Alon J. Bang-Jensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring.
More information1 The Low-Degree Testing Assumption
Advanced Complexity Theory Spring 2016 Lecture 17: PCP with Polylogarithmic Queries and Sum Check Prof. Dana Moshkovitz Scribes: Dana Moshkovitz & Michael Forbes Scribe Date: Fall 2010 In this lecture
More informationLecture 13 Spectral Graph Algorithms
COMS 995-3: Advanced Algorithms March 6, 7 Lecture 3 Spectral Graph Algorithms Instructor: Alex Andoni Scribe: Srikar Varadaraj Introduction Today s topics: Finish proof from last lecture Example of random
More informationBCCS: Computational methods for complex systems Wednesday, 16 June Lecture 3
BCCS: Computational methods for complex systems Wednesday, 16 June 2010 Lecturer: Ashley Montanaro 1 Lecture 3 Hardness of approximation 1 Overview In my lectures so far, we ve mostly restricted ourselves
More information10.4 The Kruskal Katona theorem
104 The Krusal Katona theorem 141 Example 1013 (Maximum weight traveling salesman problem We are given a complete directed graph with non-negative weights on edges, and we must find a maximum weight Hamiltonian
More informationLimits to Approximability: When Algorithms Won't Help You. Note: Contents of today s lecture won t be on the exam
Limits to Approximability: When Algorithms Won't Help You Note: Contents of today s lecture won t be on the exam Outline Limits to Approximability: basic results Detour: Provers, verifiers, and NP Graph
More informationEarthmover resilience & testing in ordered structures
Earthmover resilience & testing in ordered structures Omri Ben-Eliezer Tel-Aviv University Eldar Fischer Technion Computational Complexity Conference 28 UCSD, San Diago Property testing (RS96, GGR98) Meta
More informationHARDNESS AMPLIFICATION VIA SPACE-EFFICIENT DIRECT PRODUCTS
HARDNESS AMPLIFICATION VIA SPACE-EFFICIENT DIRECT PRODUCTS Venkatesan Guruswami and Valentine Kabanets Abstract. We prove a version of the derandomized Direct Product lemma for deterministic space-bounded
More informationLecture 15: Expanders
CS 710: Complexity Theory 10/7/011 Lecture 15: Expanders Instructor: Dieter van Melkebeek Scribe: Li-Hsiang Kuo In the last lecture we introduced randomized computation in terms of machines that have access
More informationSolutions to Assignment 4
1. Let G be a finite, abelian group written additively. Let x = g G g, and let G 2 be the subgroup of G defined by G 2 = {g G 2g = 0}. (a) Show that x = g G 2 g. (b) Show that x = 0 if G 2 = 2. If G 2
More informationFormalizing Randomized Matching Algorithms
Formalizing Randomized Matching Algorithms Stephen Cook Joint work with Dai Tri Man Lê Department of Computer Science University of Toronto Canada The Banff Workshop on Proof Complexity 2011 1 / 15 Feasible
More informationLecture Hardness of Set Cover
PCPs and Inapproxiability CIS 6930 October 5, 2009 Lecture Hardness of Set Cover Lecturer: Dr. My T. Thai Scribe: Ying Xuan 1 Preliminaries 1.1 Two-Prover-One-Round Proof System A new PCP model 2P1R Think
More informationCoin-flipping games immune against linear-sized coalitions (Extended abstract)
Coin-flipping games immune against linear-sized coalitions (Extended abstract) Abstract Noga Alon IBM Almaden Research Center, San Jose, CA 9510 and Sackler Faculty of Exact Sciences, Tel Aviv University,
More informationLecture 10: Hardness of approximating clique, FGLSS graph
CSE 533: The PCP Theorem and Hardness of Approximation (Autumn 2005) Lecture 10: Hardness of approximating clique, FGLSS graph Nov. 2, 2005 Lecturer: Venkat Guruswami and Ryan O Donnell Scribe: Ioannis
More informationLecture 6: September 22
CS294 Markov Chain Monte Carlo: Foundations & Applications Fall 2009 Lecture 6: September 22 Lecturer: Prof. Alistair Sinclair Scribes: Alistair Sinclair Disclaimer: These notes have not been subjected
More informationLecture 6: Powering Completed, Intro to Composition
CSE 533: The PCP Theorem and Hardness of Approximation (Autumn 2005) Lecture 6: Powering Completed, Intro to Composition Oct. 17, 2005 Lecturer: Ryan O Donnell and Venkat Guruswami Scribe: Anand Ganesh
More informationSublinear Algorithms Lecture 3
Sublinear Algorithms Lecture 3 Sofya Raskhodnikova Penn State University Thanks to Madhav Jha (Penn State) for help with creating these slides. Tentative Plan Lecture. Background. Testing properties of
More informationLecture 2: January 18
CS271 Randomness & Computation Spring 2018 Instructor: Alistair Sinclair Lecture 2: January 18 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They
More informationGROUPS AS GRAPHS. W. B. Vasantha Kandasamy Florentin Smarandache
GROUPS AS GRAPHS W. B. Vasantha Kandasamy Florentin Smarandache 009 GROUPS AS GRAPHS W. B. Vasantha Kandasamy e-mail: vasanthakandasamy@gmail.com web: http://mat.iitm.ac.in/~wbv www.vasantha.in Florentin
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 informationAn Elementary Construction of Constant-Degree Expanders
An Elementary Construction of Constant-Degree Expanders Noga Alon Oded Schwartz Asaf Shapira Abstract We describe a short and easy to analyze construction of constant-degree expanders. The construction
More informationDRAFT. PCP and Hardness of Approximation. Chapter 19
Chapter 19 PCP and Hardness of Approximation...most problem reductions do not create or preserve such gaps...to create such a gap in the generic reduction (cf. Cook)...also seems doubtful. The intuitive
More informationThe PCP Theorem by Gap Amplification
The PCP Theorem by Gap Amplification Irit Dinur February 13, 2007 Abstract The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only
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 informationThe Quantum Query Complexity of Algebraic Properties
The Quantum Query Complexity of Algebraic Properties Sebastian Dörn Institut für Theoretische Informatik Universität Ulm 89069 Ulm, Germany Thomas Thierauf Fak. Elektronik und Informatik HTW Aalen 73430
More informationCS294: PCP and Hardness of Approximation January 25, Notes for Lecture 3
U.C. Berkeley Handout N3 CS294: PCP and Hardness of Approximation January 25, 2006 Professor Luca Trevisan Scribe: Luca Trevisan Notes for Lecture 3 These notes are based on my survey paper [6]. L.T. Some
More informationLecture 4.1: Homomorphisms and isomorphisms
Lecture 4.: Homomorphisms and isomorphisms Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4, Modern Algebra M. Macauley (Clemson) Lecture
More informationRings, Paths, and Cayley Graphs
Spectral Graph Theory Lecture 5 Rings, Paths, and Cayley Graphs Daniel A. Spielman September 16, 2014 Disclaimer These notes are not necessarily an accurate representation of what happened in class. The
More informationGraph homomorphisms II: some examples
Graph homomorphisms II: some examples Taoyang Wu Combinatorics Study Group Notes 2, October 2006 October 6, 2006 Abstract Following the talk on graph homomorphisms given by Peter last week, we continue
More informationProbabilistically Checkable Proofs. 1 Introduction to Probabilistically Checkable Proofs
Course Proofs and Computers, JASS 06 Probabilistically Checkable Proofs Lukas Bulwahn May 21, 2006 1 Introduction to Probabilistically Checkable Proofs 1.1 History of Inapproximability Results Before introducing
More informationRandomness-efficient Low Degree Tests and Short PCPs via Epsilon-Biased Sets
Randomness-efficient Low Degree Tests and Short PCPs via Epsilon-Biased Sets Eli Ben-Sasson DEAS, Harvard University and LCS, MIT Cambridge, MA eli@eecs.harvard.edu Salil Vadhan Harvard University, Division
More informationLecture 6: Random Walks versus Independent Sampling
Spectral Graph Theory and Applications WS 011/01 Lecture 6: Random Walks versus Independent Sampling Lecturer: Thomas Sauerwald & He Sun For many problems it is necessary to draw samples from some distribution
More informationLecture 2: September 8
CS294 Markov Chain Monte Carlo: Foundations & Applications Fall 2009 Lecture 2: September 8 Lecturer: Prof. Alistair Sinclair Scribes: Anand Bhaskar and Anindya De Disclaimer: These notes have not been
More informationThe Tensor Product of Two Codes is Not Necessarily Robustly Testable
The Tensor Product of Two Codes is Not Necessarily Robustly Testable Paul Valiant Massachusetts Institute of Technology pvaliant@mit.edu Abstract. There has been significant interest lately in the task
More informationA note on network reliability
A note on network reliability Noga Alon Institute for Advanced Study, Princeton, NJ 08540 and Department of Mathematics Tel Aviv University, Tel Aviv, Israel Let G = (V, E) be a loopless undirected multigraph,
More informationAverage Case Complexity
Average Case Complexity 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
More informationCOMPUTATIONAL COMPLEXITY
COMPUTATIONAL COMPLEXITY A Modern Approach SANJEEV ARORA Princeton University BOAZ BARAK Princeton University {Щ CAMBRIDGE Щ0 UNIVERSITY PRESS Contents About this book Acknowledgments Introduction page
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationAnna University, Chennai, November/December 2012
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2012 Fifth Semester Computer Science and Engineering MA2265 DISCRETE MATHEMATICS (Regulation 2008) Part - A 1. Define Tautology with an example. A Statement
More informationA An Overview of Complexity Theory for the Algorithm Designer
A An Overview of Complexity Theory for the Algorithm Designer A.1 Certificates and the class NP A decision problem is one whose answer is either yes or no. Two examples are: SAT: Given a Boolean formula
More informationSeparating Hierarchical and General Hub Labelings
Separating Hierarchical and General Hub Labelings Andrew V. Goldberg 1 Ilya Razenshteyn 2 Ruslan Savchenko 3 1 Microsoft Research Silicon Valley 2 CSAIL, MIT 3 Moscow State University June 23, 2013 Overview
More informationLearning and Fourier Analysis
Learning and Fourier Analysis Grigory Yaroslavtsev http://grigory.us CIS 625: Computational Learning Theory Fourier Analysis and Learning Powerful tool for PAC-style learning under uniform distribution
More informationRandom Lifts of Graphs
27th Brazilian Math Colloquium, July 09 Plan of this talk A brief introduction to the probabilistic method. A quick review of expander graphs and their spectrum. Lifts, random lifts and their properties.
More informationExpander Graphs and Their Applications (X) Yijia Chen Shanghai Jiaotong University
Expander Graphs and Their Applications (X) Yijia Chen Shanghai Jiaotong University Review of the Previous Lecture Probabilistic Verifier Definition A verifier V is a probabilistic polynomial time algorithm
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 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 5: January 30
CS71 Randomness & Computation Spring 018 Instructor: Alistair Sinclair Lecture 5: January 30 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They
More information3. The Sheaf of Regular Functions
24 Andreas Gathmann 3. The Sheaf of Regular Functions After having defined affine varieties, our next goal must be to say what kind of maps between them we want to consider as morphisms, i. e. as nice
More informationCS151 Complexity Theory. Lecture 15 May 22, 2017
CS151 Complexity Theory Lecture 15 New topic(s) Optimization problems, Approximation Algorithms, and Probabilistically Checkable Proofs Optimization Problems many hard problems (especially NP-hard) are
More information