Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
|
|
- Easter Elliott
- 5 years ago
- Views:
Transcription
1
2 Deterministic identity testing for sum of read-once oblivious arithmetic branching programs Rohit Gurjar, Arpita Korwar, Nitin Saxena, IIT Kanpur Thomas Thierauf Aalen University June 18, 2015 Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
3 Introduction Polynomial Identity Testing PIT: given a polynomial P(x) F[x 1, x 2,..., x n ], P(x) = 0? Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
4 Introduction Polynomial Identity Testing PIT: given a polynomial P(x) F[x 1, x 2,..., x n ], P(x) = 0? Input Models: Arithmetic Circuits Arithmetic Branching Programs + x 2 2xy x 2 2xy x y 2 Figure: An Arithmetic circuit Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
5 Introduction Randomized Test Rephrasing the question: Given an arithmetic circuit decide if it computes the zero polynomial. Randomized PIT: evaluate P(x) at a random point [Demillo and Lipton, 1978, Zippel, 1979, Schwartz, 1980]. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
6 Introduction Randomized Test Rephrasing the question: Given an arithmetic circuit decide if it computes the zero polynomial. Randomized PIT: evaluate P(x) at a random point [Demillo and Lipton, 1978, Zippel, 1979, Schwartz, 1980]. There is no efficient deterministic test known. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
7 Introduction Randomized Test Rephrasing the question: Given an arithmetic circuit decide if it computes the zero polynomial. Randomized PIT: evaluate P(x) at a random point [Demillo and Lipton, 1978, Zippel, 1979, Schwartz, 1980]. There is no efficient deterministic test known. Two Paradigms: Whitebox: one can see the input circuit. Blackbox: circuit is hidden, only evaluations are allowed. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
8 Introduction Randomized Test Rephrasing the question: Given an arithmetic circuit decide if it computes the zero polynomial. Randomized PIT: evaluate P(x) at a random point [Demillo and Lipton, 1978, Zippel, 1979, Schwartz, 1980]. There is no efficient deterministic test known. Two Paradigms: Whitebox: one can see the input circuit. Blackbox: circuit is hidden, only evaluations are allowed. Derandomizing PIT has connections with circuit lower bounds [Kabanets and Impagliazzo, 2003, Agrawal, 2005]. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
9 Introduction Randomized Test Rephrasing the question: Given an arithmetic circuit decide if it computes the zero polynomial. Randomized PIT: evaluate P(x) at a random point [Demillo and Lipton, 1978, Zippel, 1979, Schwartz, 1980]. There is no efficient deterministic test known. Two Paradigms: Whitebox: one can see the input circuit. Blackbox: circuit is hidden, only evaluations are allowed. Derandomizing PIT has connections with circuit lower bounds [Kabanets and Impagliazzo, 2003, Agrawal, 2005]. An efficient test is known only for restricted class of circuits, e.g., Sparse polynomials, set-multilinear circuits, ROABP. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
10 Preliminaries Arithmetic Branching Program x 2 s x 1 + 2x 4 1 x1 t x 1 + x 2 5 x 2 Figure: An Arithmetic branching program. ABP: a directed acyclic graph G with a start node and an end node. Each edge has a weight from F[x]. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
11 Preliminaries Arithmetic Branching Program x 2 s x 1 + 2x 4 1 x1 t x 1 + x 2 5 x 2 Figure: An Arithmetic branching program. ABP: a directed acyclic graph G with a start node and an end node. Each edge has a weight from F[x]. C(x) = W (p), where W (p) = W (e). p paths(s,t) e p Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
12 Preliminaries Arithmetic Branching Program x 2 s x 1 + 2x 4 1 x1 t x 1 + x 2 5 x 2 Figure: An Arithmetic branching program. ABP: a directed acyclic graph G with a start node and an end node. Each edge has a weight from F[x]. C(x) = W (p), where W (p) = W (e). p paths(s,t) e p C(x) = (x 1 + 2x 4 )x 2 x 1 (x 1 + 2x 4 )x 2 + (x 1 + x 2 )5x 2 Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
13 Preliminaries Arithmetic Branching Program x 2 s x 1 + 2x 4 1 x1 t x 1 + x 2 5 x 2 Figure: An Arithmetic branching program. ABP: a directed acyclic graph G with a start node and an end node. Each edge has a weight from F[x]. C(x) = W (p), where W (p) = W (e). p paths(s,t) e p C(x) = (x 1 + 2x 4 )x 2 x 1 (x 1 + 2x 4 )x 2 + (x 1 + x 2 )5x 2 Width: maximum number of nodes in a layer. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
14 Preliminaries Read-once Oblivious ABP Any variable occurs in at most one layer. x 3 3x 1 x x x 2 x 4 1 4x 3 3 x 4 2 x x 2 2x x x 3 x Figure: A Read-once oblivious ABP with variable order (x 1, x 3, x 2, x 4 ) Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
15 Preliminaries Previous Work [Raz and Shpilka, 2005] gave a polynomial time whitebox test for ROABP. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
16 Preliminaries Previous Work [Raz and Shpilka, 2005] gave a polynomial time whitebox test for ROABP. Later, quasi-polynomial time blackbox tests were obtained [Forbes and Shpilka, 2013, Forbes et al., 2014, Agrawal et al., 2014]. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
17 Preliminaries Previous Work [Raz and Shpilka, 2005] gave a polynomial time whitebox test for ROABP. Later, quasi-polynomial time blackbox tests were obtained [Forbes and Shpilka, 2013, Forbes et al., 2014, Agrawal et al., 2014]. Sum of two ROABPs: we give the first polynomial time whitebox test (different variable orders) Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
18 Preliminaries Previous Work [Raz and Shpilka, 2005] gave a polynomial time whitebox test for ROABP. Later, quasi-polynomial time blackbox tests were obtained [Forbes and Shpilka, 2013, Forbes et al., 2014, Agrawal et al., 2014]. Sum of two ROABPs: we give the first polynomial time whitebox test (different variable orders) A(x) s 1 t 1 B(x) s 2 t 2 Figure: Sum of two ROABPs Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
19 Preliminaries Previous Work [Raz and Shpilka, 2005] gave a polynomial time whitebox test for ROABP. Later, quasi-polynomial time blackbox tests were obtained [Forbes and Shpilka, 2013, Forbes et al., 2014, Agrawal et al., 2014]. Sum of two ROABPs: we give the first polynomial time whitebox test (different variable orders) s A(x) + B(x) t Figure: Sum of two ROABPs Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
20 Preliminaries Previous Work [Raz and Shpilka, 2005] gave a polynomial time whitebox test for ROABP. Later, quasi-polynomial time blackbox tests were obtained [Forbes and Shpilka, 2013, Forbes et al., 2014, Agrawal et al., 2014]. Sum of two ROABPs: we give the first polynomial time whitebox test (different variable orders) s A(x) + B(x) t Figure: Sum of two ROABPs Sum of two ROABPs not captured by ROABP [Nair and Saha, 2014]. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
21 Characterizing ROABPs Evaluation Dimension or Partial Coefficient Dimension [Nisan, 1991] F-linear dependence of polynomials: P 1 = 1 + x 1 P 2 = x 1 x 2 P 3 = 1 + x 1 + 2x 1 x 2 P 1 + 2P 2 P 3 = 0 Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
22 Characterizing ROABPs Evaluation Dimension or Partial Coefficient Dimension [Nisan, 1991] Any multilinear polynomial A(x) can be written as: where A 0, A 1 F[x 2, x 3,..., x n ]. A = A 0 + x 1 A 1, Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
23 Characterizing ROABPs Evaluation Dimension or Partial Coefficient Dimension [Nisan, 1991] Any multilinear polynomial A(x) can be written as: A = A 0 + x 1 A 1, where A 0, A 1 F[x 2, x 3,..., x n ]. Similarly, A = A 00 + x 1 A 10 + x 2 A 01 + x 1 x 2 A 11, where A 00, A 10, A 01, A 11 F[x 3,..., x n ]. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
24 Characterizing ROABPs Evaluation Dimension or Partial Coefficient Dimension [Nisan, 1991] Any multilinear polynomial A(x) can be written as: where A 0, A 1 F[x 2, x 3,..., x n ]. Similarly, A = A 0 + x 1 A 1, A = A 00 + x 1 A 10 + x 2 A 01 + x 1 x 2 A 11, where A 00, A 10, A 01, A 11 F[x 3,..., x n ]. A = e {0,1} i x e1 1 x e 2 2 x e i i A e, where A e F[x i+1,..., x n ] Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
25 Characterizing ROABPs Coefficient Dimension = Minimum width [Nisan, 1991] A multilinear polynomial A is computed by an ROABP of width-w and variable order (x 1, x 2,..., x n ) if and only if dim{a e e {0, 1} i } w, i [n]. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
26 Characterizing ROABPs Coefficient Dimension Width A multilinear polynomial A is computed by an ROABP of width-w and variable order (x 1, x 2,..., x n ) = dim{a e e {0, 1} i } w, i [n]. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
27 Characterizing ROABPs Coefficient Dimension Width A multilinear polynomial A is computed by an ROABP of width-w and variable order (x 1, x 2,..., x n ) = dim{a e e {0, 1} i } w, i [n]. v 1 v 2 s t x 1. vw x i x i+1 xn Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
28 Characterizing ROABPs Coefficient Dimension Width A multilinear polynomial A is computed by an ROABP of width-w and variable order (x 1, x 2,..., x n ) = dim{a e e {0, 1} i } w, i [n]. s x i. v 1 v 2 vw Q 1 Q 2 Qw t Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
29 Characterizing ROABPs Coefficient Dimension Width A multilinear polynomial A is computed by an ROABP of width-w and variable order (x 1, x 2,..., x n ) = dim{a e e {0, 1} i } w, i [n]. v 1 s P 1 P 2 v 2 Q 1 Q 2 t Pw. vw Qw x 1 x i x i+1 xn A = w j=1 P jq j, where P j F[x 1,..., x i ] and Q j F[x i+1,..., x n ] for each j. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
30 Characterizing ROABPs Coefficient Dimension width A multilinear polynomial A is computed by an ROABP of width-w and variable order (x 1, x 2,..., x n ) = dim{a e e {0, 1} i } w, i [n]. 2x 1 + 3x 2 v 1 Q 1 A s 1 + x 1 + 5x 1 x 2 v 2 Q 2 t x 1 x 2. vw Qw Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
31 Characterizing ROABPs Coefficient Dimension width A multilinear polynomial A is computed by an ROABP of width-w and variable order (x 1, x 2,..., x n ) = dim{a e e {0, 1} i } w, i [n]. 2x 1 + 3x 2 v 1 Q 1 A s 1 + x 1 + 5x 1 x 2 v 2 Q 2 t 1x 1 x 2. vw Qw Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
32 Characterizing ROABPs Coefficient Dimension width A multilinear polynomial A is computed by an ROABP of width-w and variable order (x 1, x 2,..., x n ) = dim{a e e {0, 1} i } w, i [n]. 0 v 1 Q 1 A 11 s 5 v 2 Q 2 t 1. vw Qw Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
33 Characterizing ROABPs Coefficient Dimension width A multilinear polynomial A is computed by an ROABP of width-w and variable order (x 1, x 2,..., x n ) = dim{a e e {0, 1} i } w, i [n]. v 1 α 1 Q 1 Ae s α 2 v 2 Q 2 t αw. vw Qw w A e = α j Q j, j=1 where α j F and Q j F[x i+1,..., x n ] for each j. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
34 Characterizing ROABPs Coefficient Dimension = Minimum width [Nisan, 1991] A multilinear polynomial A is computed by an ROABP of width-w and variable order (x 1, x 2,..., x n ) = dim{a e e {0, 1} i } w, i [n]. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
35 Characterizing ROABPs Width Coefficient Dimension For a polynomial A, small Coefficient dimension = small width ROABP. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
36 Characterizing ROABPs Width Coefficient Dimension For a polynomial A, small Coefficient dimension = small width ROABP. s 1 x 1 A 1 A 0 t A = A 0 + x 1 A 1 Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
37 Characterizing ROABPs Width Coefficient Dimension For a polynomial A, small Coefficient dimension = small width ROABP. 1 A 00 1 x 2 A 01 s x 1 1 A 10 A 11 t x 2 A = A 00 + x 1 A 10 + x 2 A 01 + x 1 x 2 A 11 Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
38 Characterizing ROABPs Width Coefficient Dimension For a polynomial A, small Coefficient dimension = small width ROABP. A e1 A e2 s t. A ew x i A = P 1 A e1 + P 2 A e2 + + P w A ew Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
39 Characterizing ROABPs Width Coefficient Dimension For a polynomial A, small Coefficient dimension = small width ROABP. 1 (A e1 ) 0 x i+1 (A e1 ) 1 1 (A e2 ) 0 x i+1 s (A e2 ) 1 t x i. 1 x i+1 (A ew ) 0 (A ew ) 1 A ej = (A ej ) 0 + x i+1 (A ej ) 1 Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
40 Characterizing ROABPs Width Coefficient Dimension For a polynomial A, small Coefficient dimension = small width ROABP. 1 x i+1 1 x i+1 A b2 A b1 A b3 s t x i. 1 x i+1 A b2w Suppose A b3 = 3A b1 + 2A b2 Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
41 Characterizing ROABPs Width Coefficient Dimension For a polynomial A, small Coefficient dimension = small width ROABP. 1 x i x i+1 A b2 A b1 A b3 s t. 1 A b2w x i x i+1 Suppose A b3 = 3A b1 + 2A b2 Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
42 Characterizing ROABPs Width Coefficient Dimension For a polynomial A, small Coefficient dimension = small width ROABP. 1 x i x i+1 A b2 A b1 s t. 1 A b2w x i x i+1 Suppose A b3 = 3A b1 + 2A b2 Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
43 Characterizing ROABPs Width Coefficient Dimension For a polynomial A, small Coefficient dimension = small width ROABP. A b1 A b2 s t. x i x i+1 Note that these dependencies essentially define the ROABP. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
44 Characterizing ROABPs Width Coefficient Dimension For a polynomial A, small Coefficient dimension = small width ROABP. A b1 A b2 s t. x i x i+1 Dependency support at most w + 1. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
45 Sum of two ROABPs Equivalence of two ROABPs A = B?, where A has an ROABP in variable order (x 1, x 2,..., x n ). Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
46 Sum of two ROABPs Equivalence of two ROABPs A = B?, where A has an ROABP in variable order (x 1, x 2,..., x n ). Step 1: Find the linear dependencies among partial coefficients of A. Step 2: Verify if the same dependencies hold among the corresponding partial coefficients of B. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
47 Sum of two ROABPs Equivalence of two ROABPs A = B?, where A has an ROABP in variable order (x 1, x 2,..., x n ). Step 1: Find the linear dependencies among partial coefficients of A. Step 2: Verify if the same dependencies hold among the corresponding partial coefficients of B. For example, if A b3 = 3A b1 + 2A b2, then verify whether B b3 = 3B b1 + 2B b2. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
48 Sum of two ROABPs Equivalence of two ROABPs A = B?, where A has an ROABP in variable order (x 1, x 2,..., x n ). Step 1: Find the linear dependencies among partial coefficients of A. Step 2: Verify if the same dependencies hold among the corresponding partial coefficients of B. For example, if A b3 = 3A b1 + 2A b2, then verify whether B b3 = 3B b1 + 2B b2. If any dependency fails, then A B. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
49 Sum of two ROABPs Equivalence of two ROABPs A = B?, where A has an ROABP in variable order (x 1, x 2,..., x n ). Step 1: Find the linear dependencies among partial coefficients of A. Step 2: Verify if the same dependencies hold among the corresponding partial coefficients of B. For example, if A b3 = 3A b1 + 2A b2, then verify whether B b3 = 3B b1 + 2B b2. If any dependency fails, then A B. If all the dependencies hold then A = cb for some constant c. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
50 Sum of two ROABPs Equivalence of two ROABPs A = B?, where A has an ROABP in variable order (x 1, x 2,..., x n ). Step 1: Find the linear dependencies among partial coefficients of A. Step 2: Verify if the same dependencies hold among the corresponding partial coefficients of B. For example, if A b3 = 3A b1 + 2A b2, then verify whether B b3 = 3B b1 + 2B b2. If any dependency fails, then A B. If all the dependencies hold then A = cb for some constant c. Question: how to verify dependencies for B? Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
51 Sum of two ROABPs Verifying Dependencies for B For example B B 10 B 11 = x 1 2x 2 3x 2 1 B s 1 x 1 t 2 + x x 2 Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
52 Sum of two ROABPs Verifying Dependencies for B For example B B 10 B 11 = x x 2 3x 2 1 B s 1 x 1 t 2 + x x B 00 s 1 1 t 2 5 Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
53 Sum of two ROABPs Verifying Dependencies for B For example B B 10 B 11 = x x 2 3x 2 1 B s 1 1x 1 t 2 + 1x x B 10 s 1 1 t 1 5 Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
54 Sum of two ROABPs Verifying Dependencies for B For example B B 10 B 11 = x 1 2x 2 3x 2 1 B s 1 1x 1 t 2 + 1x x B 11 s 1 3 t 1 4 Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
55 Sum of two ROABPs Verifying Dependencies Verifying dependencies for B? For example B B 10 B 11 = 0. B 00, B 10 and B 11 all three have an ROABP in the same variable order. s 1... t 1 B 00 s 2... t 2 B 10 s 3... t 3 B 11 Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
56 Sum of two ROABPs Verifying Dependencies Verifying dependencies for B? For example B B 10 B 11 = 0. B 00, B 10 and B 11 all three have an ROABP in the same variable order. s t It reduces to zero testing for an ROABP of a larger width ( w(w + 1)). Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
57 Conclusion Generalizations We generalize this test to sum of c ROABPs with time complexity poly(w 2c n c ). Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
58 Conclusion Generalizations We generalize this test to sum of c ROABPs with time complexity poly(w 2c n c ). We also make this test blackbox but with quasi-polynomial cost (nw) c 2c log nw. based on the ideas of least basis isolation and low-support rank-concentration. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
59 Conclusion Generalizations We generalize this test to sum of c ROABPs with time complexity poly(w 2c n c ). We also make this test blackbox but with quasi-polynomial cost (nw) c 2c log nw. based on the ideas of least basis isolation and low-support rank-concentration. The same techniques work in the case of higher individual degree, with essentially the same time complexity. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
60 Conclusion Discussion Can one bring down the time complexity from w O(2c) to w O(c)? Can we use these ideas to solve depth-3 multilinear circuits? Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
61 Conclusion Discussion Can one bring down the time complexity from w O(2c) to w O(c)? Can we use these ideas to solve depth-3 multilinear circuits? Our proof was inspired from a question in the boolean setting equivalence of two ROBPs. Are there more connections? Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
62 Conclusion Thank you Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
63 Conclusion Generalizations We generalize this test to sum of c ROABPs with time complexity poly(w 2c n c ). Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
64 Conclusion Generalizations We generalize this test to sum of c ROABPs with time complexity poly(w 2c n c ). A 1 = A 2 + A A c 1? Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
65 Conclusion Generalizations We generalize this test to sum of c ROABPs with time complexity poly(w 2c n c ). A 1 = A 2 + A A c 1? Take dependencies of A 1 and verify for A 2 + A 3 + A c 1. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
66 Conclusion Generalizations We generalize this test to sum of c ROABPs with time complexity poly(w 2c n c ). A 1 = A 2 + A A c 1? Take dependencies of A 1 and verify for A 2 + A 3 + A c 1. Reduces to PIT for sum of c 1 ROABPs. T (w, c) = nwt (c 1, w 2 ) + poly(n, w) Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
67 Conclusion Dependencies for A Say, A has variable order (x 1, x 2,..., x n ). v 1 α 1 Q 1 Ae s α 2 v 2 Q 2 t αw. vw Qw Recall that for any e {0, 1} i, A e = w α j Q j, where α j F j=1 Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
68 Conclusion Dependencies for A Say, A has variable order (x 1, x 2,..., x n ). v 1 α 1 Q 1 Ae s α 2 v 2 Q 2 t αw. vw Qw Recall that for any e {0, 1} i, A e = w α j Q j, where α j F j=1 Consider the vectors (α 1, α 2,..., α w ), and find the dependencies. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
69 Bibliography Agrawal, M. (2005). Proving lower bounds via pseudo-random generators. In FSTTCS, volume 3821 of Lecture Notes in Computer Science, pages Agrawal, M., Gurjar, R., Korwar, A., and Saxena, N. (2014). Hitting-sets for ROABP and sum of set-multilinear circuits. Electronic Colloquium on Computational Complexity (ECCC), 21:85. (to appear in SICOMP, 2015). Demillo, R. A. and Lipton, R. J. (1978). A probabilistic remark on algebraic program testing. Information Processing Letters, 7(4): Forbes, M. A., Saptharishi, R., and Shpilka, A. (2014). Hitting sets for multilinear read-once algebraic branching programs, in any order. In Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014, pages Forbes, M. A. and Shpilka, A. (2013). Quasipolynomial-time identity testing of non-commutative and read-once oblivious algebraic branching programs. In FOCS, pages Kabanets, V. and Impagliazzo, R. (2003). Derandomizing polynomial identity tests means proving circuit lower bounds. STOC, pages Nair, V. and Saha, C. (2014). Personal communication. Nisan, N. (1991). Lower bounds for non-commutative computation (extended abstract). In Proceedings of the 23rd ACM Symposium on Theory of Computing, ACM Press, pages Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
70 Bibliography Raz, R. and Shpilka, A. (2005). Deterministic polynomial identity testing in non-commutative models. Computational Complexity, 14(1):1 19. Schwartz, J. T. (1980). Fast probabilistic algorithms for verification of polynomial identities. J. ACM, 27(4): Zippel, R. (1979). Probabilistic algorithms for sparse polynomials. In Proceedings of the International Symposium on on Symbolic and Algebraic Computation, EUROSAM 79, pages , London, UK, UK. Springer-Verlag. Gurjar, Korwar, Saxena, Thierauf PIT for sum of ROABPs June 18, / 22
Ben Lee Volk. Joint with. Michael A. Forbes Amir Shpilka
Ben Lee Volk Joint with Michael A. Forbes Amir Shpilka Ben Lee Volk Joint with Michael A. Forbes Amir Shpilka (One) Answer: natural proofs barrier [Razborov-Rudich]: (One) Answer: natural proofs barrier
More informationDeterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs arxiv: v2 [cs.cc] 16 May 2015
Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs arxiv:1411.7341v2 [cs.cc] 16 May 2015 Rohit Gurjar 1, Arpita Korwar 1, Nitin Saxena 1 and Thomas Thierauf 2 1
More informationPolynomial Identity Testing and Lower Bounds for Sum of Special Arithmetic Branching Programs
Polynomial Identity Testing and Lower Bounds for Sum of Special Arithmetic Branching Programs A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy by Arpita
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 informationExplicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing Michael A. Forbes Amir Shpilka March 7, 2013 Abstract Mulmuley [Mul12a] recently gave an explicit version of
More informationReconstruction of full rank algebraic branching programs
Reconstruction of full rank algebraic branching programs Vineet Nair Joint work with: Neeraj Kayal, Chandan Saha, Sebastien Tavenas 1 Arithmetic circuits 2 Reconstruction problem f(x) Q[X] is an m-variate
More informationPolynomial Identity Testing. Amir Shpilka Technion
Polynomial Identity Testing Amir Shpilka Technion 1 Goal of talk Model: Arithmetic circuits Problem: Polynomial Identity Testing Example: Depth-3 circuits Some open problems 2 Holy grail: P vs. NP Boolean
More informationarxiv: v2 [cs.cc] 20 May 2018
arxiv:1805.06692v2 [cs.cc] 20 May 2018 A Note on Polynomial Identity Testing for Depth-3 Circuits V. Arvind Abhranil Chatterjee Rajit Datta Partha Mukhopadhyay May 22, 2018 Abstract Let C be a depth-3
More informationPolynomial Identity Testing
Polynomial Identity Testing Amir Shpilka Technion and MSR NE Based on joint works with: Zeev Dvir, Zohar Karnin, Partha Mukhopadhyay, Ran Raz, Ilya Volkovich and Amir Yehudayoff 1 PIT Survey Oberwolfach
More informationDeterministic identity testing of depth 4 multilinear circuits with bounded top fan-in
Deterministic identity testing of depth 4 multilinear circuits with bounded top fan-in Zohar S. Karnin Partha Mukhopadhyay Amir Shpilka Ilya Volkovich November 15, 2009 Abstract We give the first sub-exponential
More informationThe Power of Depth 2 Circuits over Algebras
The Power of Depth 2 Circuits over Algebras Chandan Saha, Ramprasad Saptharishi 2 and Nitin Saxena 3 Indian Institute of Technology, Kanpur 20806, India csaha@iitk.ac.in 2 Chennai Mathematical Institute,
More informationMore on Noncommutative Polynomial Identity Testing
More on Noncommutative Polynomial Identity Testing Andrej Bogdanov Hoeteck Wee Abstract We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient
More informationSums of Products of Polynomials in Few Variables: Lower Bounds and Polynomial Identity Testing
Sums of Products of Polynomials in Few Variables: Lower Bounds and Polynomial Identity Testing Mrinal Kumar 1 and Shubhangi Saraf 2 1 Department of Computer Science, Rutgers University, New Brunswick,
More informationSums of products of polynomials of low-arity - lower bounds and PIT
Sums of products of polynomials of low-arity - lower bounds and PIT Mrinal Kumar Joint work with Shubhangi Saraf Plan for the talk Plan for the talk Model of computation Plan for the talk Model of computation
More informationLower bounds for multilinear bounded order ABPs
Lower bounds for multilinear bounded order ABPs C. Ramya B. V. Raghavendra Rao IIT Madras, Chennai, India {ramya,bvrr}@cse.iitm.ac.in January 15, 2019 arxiv:1901.04377v1 [cs.cc] 14 Jan 2019 Abstract Proving
More informationNovember 17, Recent Results on. Amir Shpilka Technion. PIT Survey Oberwolfach
1 Recent Results on Polynomial Identity Testing Amir Shpilka Technion Goal of talk Survey known results Explain proof techniques Give an interesting set of `accessible open questions 2 Talk outline Definition
More informationDiagonal Circuit Identity Testing and Lower Bounds
Diagonal Circuit Identity Testing and Lower Bounds Nitin Saxena Hausdorff Center for Mathematics Endenicher Allee 60 D-53115 Bonn, Germany ns@hcm.uni-bonn.de Abstract. In this paper we give the first deterministic
More informationArithmetic Circuits with Locally Low Algebraic Rank
Arithmetic Circuits with Locally Low Algebraic Rank Mrinal Kumar 1 and Shubhangi Saraf 2 1 Department of Computer Science, Rutgers University, New Brunswick, USA mrinal.kumar@rutgers.edu 2 Department of
More informationDETERMINISTIC POLYNOMIAL IDENTITY TESTS FOR MULTILINEAR BOUNDED-READ FORMULAE
DETERMINISTIC POLYNOMIAL IDENTITY TESTS FOR MULTILINEAR BOUNDED-READ FORMULAE Matthew Anderson, Dieter van Melkebeek, and Ilya Volkovich June 20, 2014 Abstract. We present a polynomial-time deterministic
More informationMeta-Algorithms vs. Circuit Lower Bounds Valentine Kabanets
Meta-Algorithms vs. Circuit Lower Bounds Valentine Kabanets Tokyo Institute of Technology & Simon Fraser University Understanding Efficiency Better understanding of Efficient Computation Good Algorithms
More informationNon-commutative computations: lower bounds and polynomial identity testing
Electronic Colloquium on Computational Complexity, Report No. 94 (2016) Non-commutative computations: lower bounds and polynomial identity testing Guillaume Lagarde Guillaume Malod Sylvain Perifel June
More informationarxiv: v2 [cs.cc] 27 Jan 2016
Bipartite Perfect Matching is in quasi-nc Stephen Fenner 1, Rohit Gurjar 2, and Thomas Thierauf 2 arxiv:1601.06319v2 [cs.cc] 27 Jan 2016 1 University of South Carolina 2 Aalen University, Germany January
More informationArithmetic Circuits: A Chasm at Depth Four
Arithmetic Circuits: A Chasm at Depth Four Manindra Agrawal Indian Institute of Technology, Kanpur V Vinay Geodesic Information Systems Ltd, Bangalore, and Chennai Mathematical Institute, Chennai August
More informationDeterminant Versus Permanent
Determinant Versus Permanent Manindra Agrawal Abstract. We study the problem of expressing permanent of matrices as determinant of (possibly larger) matrices. This problem has close connections with complexity
More informationDeterministically Testing Sparse Polynomial Identities of Unbounded Degree
Deterministically Testing Sparse Polynomial Identities of Unbounded Degree Markus Bläser a Moritz Hardt b,,1 Richard J. Lipton c Nisheeth K. Vishnoi d a Saarland University, Saarbrücken, Germany. b Princeton
More informationRank Bound for Depth-3 Identities
Rank Bound for Depth-3 Identities Nitin Saxena (Hausdorff Center for Mathematics, Bonn) Joint work with C. Seshadhri (IBM Almaden Research Center, San Jose) 1 The problem of PIT Polynomial identity testing:
More informationLecture 7: Schwartz-Zippel Lemma, Perfect Matching. 1.1 Polynomial Identity Testing and Schwartz-Zippel Lemma
CSE 521: Design and Analysis of Algorithms I Winter 2017 Lecture 7: Schwartz-Zippel Lemma, Perfect Matching Lecturer: Shayan Oveis Gharan 01/30/2017 Scribe: Philip Cho Disclaimer: These notes have not
More informationMulti-Linear Formulas for Permanent and Determinant are of Super-Polynomial Size
Multi-Linear Formulas for Permanent and Determinant are of Super-Polynomial Size Ran Raz Weizmann Institute ranraz@wisdom.weizmann.ac.il Abstract An arithmetic formula is multi-linear if the polynomial
More informationArithmetic circuits: A chasm at depth three
Electronic Colloquium on Computational Complexity, Report No. 26 (2013) Arithmetic circuits: A chasm at depth three four Ankit Gupta Microsoft Research India t-ankitg@microsoft.com Neeraj Kayal Microsoft
More informationDeterminant versus permanent
Determinant versus permanent Manindra Agrawal Abstract. We study the problem of expressing permanents of matrices as determinants of (possibly larger) matrices. This problem has close connections to the
More informationRead-Once Polynomial Identity Testing
Read-Once Polynomial Identity Testing Amir Shpilka Ilya Volkovich Abstract An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations
More informationArithmetic circuits: A chasm at depth three
Electronic Colloquium on Computational Complexity, Revision 1 of Report No. 26 (2013) Arithmetic circuits: A chasm at depth three four Ankit Gupta Microsoft Research India t-ankitg@microsoft.com Neeraj
More informationWEAKENING ASSUMPTIONS FOR DETERMINISTIC SUBEXPONENTIAL TIME NON-SINGULAR MATRIX COMPLETION MAURICE JANSEN
Symposium on Theoretical Aspects of Computer Science 2010 (Nancy, France), pp. 465-476 www.stacs-conf.org WEAKENING ASSUMPTIONS FOR DETERMINISTIC SUBEXPONENTIAL TIME NON-SINGULAR MATRIX COMPLETION MAURICE
More informationLearning Restricted Models of Arithmetic Circuits
Learning Restricted Models of Arithmetic Circuits Adam R. Klivans Department of Computer Science University of Texas at Austin Austin, TX 78712-1188 klivans@cs.utexas.edu Amir Shpilka Faculty of Computer
More informationA Note on the Karp-Lipton Collapse for the Exponential Hierarchy
A Note on the Karp-Lipton Collapse for the Exponential Hierarchy Chris Bourke Department of Computer Science & Engineering University of Nebraska Lincoln, NE 68503, USA Email: cbourke@cse.unl.edu January
More informationarxiv: v1 [cs.cc] 14 Nov 2010
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn t matter Nitin Saxena Hausdorff Center for Mathematics Bonn, Germany ns@hcm.uni-bonn.de C. Seshadhri Sandia National Laboratories
More informationAsymptotically Optimal Hitting Sets Against Polynomials
Asymptotically Optimal Hitting Sets Against Polynomials Markus Bläser 1, Moritz Hardt 2, and David Steurer 2 1 Saarland University, Saarbrücken, Germany 2 Princeton University, Princeton, NJ Abstract.
More information1 Randomized Computation
CS 6743 Lecture 17 1 Fall 2007 1 Randomized Computation Why is randomness useful? Imagine you have a stack of bank notes, with very few counterfeit ones. You want to choose a genuine bank note to pay at
More informationImproved Polynomial Identity Testing for Read-Once Formulas
Improved Polynomial Identity Testing for Read-Once Formulas Amir Shpilka Ilya Volkovich Abstract An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree)
More informationTensor-Rank and Lower Bounds for Arithmetic Formulas
Electronic Colloquium on Computational Complexity, Report No. 2 (2010) Tensor-Rank and Lower Bounds for Arithmetic Formulas Ran Raz Weizmann Institute Abstract We show that any explicit example for a tensor
More informationOn the Structure and Complexity of Symbolic Proofs of Polynomial Identities
On the Structure and Complexity of Symbolic Proofs of Polynomial Identities Iddo Tzameret Tel Aviv University, Tel Aviv 69978, Israel Abstract A symbolic proof for establishing that a given arithmetic
More informationDoes randomness solve problems? Russell Impagliazzo UCSD
Does randomness solve problems? Russell Impagliazzo UCSD Well, what s the answer? YES, randomness solves problems BUT the randomness (probably) doesn t have to be random to solve problems. Algorithm: A
More informationLecture 24: Randomized Complexity, Course Summary
6.045 Lecture 24: Randomized Complexity, Course Summary 1 1/4 1/16 1/4 1/4 1/32 1/16 1/32 Probabilistic TMs 1/16 A probabilistic TM M is a nondeterministic TM where: Each nondeterministic step is called
More information1 Introduction The relation between randomized computations with one-sided error and randomized computations with two-sided error is one of the most i
Improved derandomization of BPP using a hitting set generator Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. oded@wisdom.weizmann.ac.il Avi Wigderson Institute
More informationQUASI-POLYNOMIAL HITTING-SET FOR SET-DEPTH- FORMULAS
Electronic Colloquium on Computational Complexity, Report No. 113 (2012) QUAI-POLYNOMIAL HITTING-ET FOR ET-DEPTH- FORMULA MANINDRA AGRAWAL, CHANDAN AHA, AND NITIN AXENA Abstract. We call a depth-4 formula
More informationSums of read-once formulas: How many summands suffice?
Sums of read-once formulas: How many summands suffice? Meena Mahajan and Anuj Tawari The Institute of Mathematical Sciences, Chennai, India. {meena,anujvt}@imsc.res.in Abstract. An arithmetic read-once
More informationLecture 22: Derandomization Implies Circuit Lower Bounds
Advanced Complexity Theory Spring 2016 Lecture 22: Derandomization Implies Circuit Lower Bounds Prof. Dana Moshkovitz 1 Overview In the last lecture we saw a proof presented by Madhu Sudan that E SIZE(2
More informationAlgorithms for Testing Monomials in Multivariate Polynomials
Electronic Colloquium on Computational Complexity, Report No. 122 (2010) Algorithms for Testing Monomials in Multivariate Polynomials Zhixiang Chen Bin Fu Yang Liu Robert Schweller Department of Computer
More informationTensor-Rank and Lower Bounds for Arithmetic Formulas
Tensor-Rank and Lower Bounds for Arithmetic Formulas Ran Raz Weizmann Institute Abstract We show that any explicit example for a tensor A : [n] r F with tensor-rank n r (1 o(1)), where r = r(n) log n/
More informationA Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits Ran Raz Amir Shpilka Amir Yehudayoff Abstract We construct an explicit polynomial f(x 1,..., x n ), with coefficients in {0,
More informationHARDNESS-RANDOMNESS TRADEOFFS FOR BOUNDED DEPTH ARITHMETIC CIRCUITS
SIAM J. COMPUT. Vol. 39, No. 4, pp. 1279 1293 c 2009 Society for Industrial and Applied Mathematics HARDNESS-RANDOMNESS TRADEOFFS FOR BOUNDED DEPTH ARITHMETIC CIRCUITS ZEEV DVIR, AMIR SHPILKA, AND AMIR
More informationRandomized Algorithms. Lecture 4. Lecturer: Moni Naor Scribe by: Tamar Zondiner & Omer Tamuz Updated: November 25, 2010
Randomized Algorithms Lecture 4 Lecturer: Moni Naor Scribe by: Tamar Zondiner & Omer Tamuz Updated: November 25, 2010 1 Pairwise independent hash functions In the previous lecture we encountered two families
More informationIntroduction to Arithmetic Circuit Complexity
Introduction to Arithmetic Circuit Complexity Amir Shpilka Technion 1 Goal of talk Survey results in arithmetic circuit complexity! Lower Bounds! Identity Testing! Reconstruction/Interpolation/Learning!
More informationClassifying polynomials and identity testing
Classifying polynomials and identity testing MANINDRA AGRAWAL 1, and RAMPRASAD SAPTHARISHI 2 1 Indian Institute of Technology, Kanpur, India. 2 Chennai Mathematical Institute, and Indian Institute of Technology,
More informationTHE BLACK-BOX QUERY COMPLEXITY OF POLYNOMIAL SUMMATION
THE BLACK-BOX QUERY COMPLEXITY OF POLYNOMIAL SUMMATION Ali Juma, Valentine Kabanets, Charles Rackoff, and Amir Shpilka Abstract. For any given Boolean formula φ(x 1,..., x n ), one can efficiently construct
More informationA Polynomial Time Deterministic Algorithm for Identity Testing Read-Once Polynomials
A Polynomial Time Deterministic Algorithm for Identity Testing Read-Once Polynomials Daniel Minahan Ilya Volkovich August 15, 2016 Abstract The polynomial identity testing problem, or PIT, asks how we
More informationFull text available at: Arithmetic Circuits: A Survey of Recent Results and Open Questions
Arithmetic Circuits: A Survey of Recent Results and Open Questions Arithmetic Circuits: A Survey of Recent Results and Open Questions Amir Shpilka Faculty of Computer Science Technion, Haifa 32000 Israel
More informationCSC 5170: Theory of Computational Complexity Lecture 5 The Chinese University of Hong Kong 8 February 2010
CSC 5170: Theory of Computational Complexity Lecture 5 The Chinese University of Hong Kong 8 February 2010 So far our notion of realistic computation has been completely deterministic: The Turing Machine
More informationThe power and weakness of randomness (when you are short on time) Avi Wigderson Institute for Advanced Study
The power and weakness of randomness (when you are short on time) Avi Wigderson Institute for Advanced Study Plan of the talk Computational complexity -- efficient algorithms, hard and easy problems, P
More informationTwo Comments on Targeted Canonical Derandomizers
Two Comments on Targeted Canonical Derandomizers Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. oded.goldreich@weizmann.ac.il April 8, 2011 Abstract We revisit
More informationFast Approximate Matrix Multiplication by Solving Linear Systems
Electronic Colloquium on Computational Complexity, Report No. 117 (2014) Fast Approximate Matrix Multiplication by Solving Linear Systems Shiva Manne 1 and Manjish Pal 2 1 Birla Institute of Technology,
More informationarxiv: v3 [cs.cc] 13 Jan 2015
Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs (preliminary version) Fu Li Tsinghua University Iddo Tzameret Royal Holloway, University of London Zhengyu
More informationPoly-logarithmic independence fools AC 0 circuits
Poly-logarithmic independence fools AC 0 circuits Mark Braverman Microsoft Research New England January 30, 2009 Abstract We prove that poly-sized AC 0 circuits cannot distinguish a poly-logarithmically
More informationIntroduction to Interactive Proofs & The Sumcheck Protocol
CS294: Probabilistically Checkable and Interactive Proofs January 19, 2017 Introduction to Interactive Proofs & The Sumcheck Protocol Instructor: Alessandro Chiesa & Igor Shinkar Scribe: Pratyush Mishra
More informationInput-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly
Electronic Colloquium on Computational Complexity, Report No. 23 (2011) Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly Oded Goldreich and Or Meir Department of Computer Science
More informationCharacterizing Propositional Proofs as Non-Commutative Formulas
Characterizing Propositional Proofs as Non-Commutative Formulas Fu Li Iddo Tzameret Zhengyu Wang Abstract Does every Boolean tautology have a short propositional-calculus proof? Here, a propositionalcalculus
More informationThe Black-Box Query Complexity of Polynomial Summation
The Black-Box Query Complexity of Polynomial Summation Ali Juma Department of Computer Science University of Toronto Toronto, Canada ajuma@cs.toronto.edu Charles Rackoff Department of Computer Science
More information1.3 Distance and Midpoint Formulas
Graduate Teacher Department of Mathematics San Diego State University Dynamical Systems Program August 29, 2011 In mathematics, a theorem is a statement that has been proven on the basis of previously
More informationLecture 26. Daniel Apon
Lecture 26 Daniel Apon 1 From IPPSPACE to NPPCP(log, 1): NEXP has multi-prover interactive protocols If you ve read the notes on the history of the PCP theorem referenced in Lecture 19 [3], you will already
More informationLesson 7: Algebraic Expressions The Commutative and Associative Properties
: Algebraic Expressions The Commutative and Associative Properties Four Properties of Arithmetic: The Commutative Property of Addition: If a and b are real numbers, then a + b = b + a. The Associative
More informationThe Chasm at Depth Four, and Tensor Rank: Old results, new insights
The Chasm at Depth Four, and Tensor Rank: Old results, new insights Suryajith Chillara 1 Joint work with Mrinal Kumar, Ramprasad Saptharishi and V. Vinay June 12, 2017 1 Research partly supported by TCS
More informationEquivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization Swastik Kopparty Shubhangi Saraf Amir Shpilka Abstract In this paper we show that the problem of deterministically
More informationProgress on Polynomial Identity Testing
Electronic Colloquium on Computational Complexity, Report No. 101 (2009) Progress on Polynomial Identity Testing Nitin Saxena Abstract Polynomial identity testing (PIT) is the problem of checking whether
More informationALGEBRAIC PROOFS OVER NONCOMMUTATIVE FORMULAS
Electronic Colloquium on Computational Complexity, Report No. 97 (2010) ALGEBRAIC PROOFS OVER NONCOMMUTATIVE FORMULAS IDDO TZAMERET Abstract. We study possible formulations of algebraic propositional proof
More informationRoots and Coefficients Polynomials Preliminary Maths Extension 1
Preliminary Maths Extension Question If, and are the roots of x 5x x 0, find the following. (d) (e) Question If p, q and r are the roots of x x x 4 0, evaluate the following. pq r pq qr rp p q q r r p
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 informationCommunication is bounded by root of rank
Electronic Colloquium on Computational Complexity, Report No. 84 (2013) Communication is bounded by root of rank Shachar Lovett June 7, 2013 Abstract We prove that any total boolean function of rank r
More informationAlgebraic Proof Complexity: Progress, Frontiers and Challenges
Algebraic Proof Complexity: Progress, Frontiers and Challenges Toniann Pitassi Iddo Tzameret July 1, 2016 Abstract We survey recent progress in the proof complexity of strong proof systems and its connection
More informationCSC 2429 Approaches to the P versus NP Question. Lecture #12: April 2, 2014
CSC 2429 Approaches to the P versus NP Question Lecture #12: April 2, 2014 Lecturer: David Liu (Guest) Scribe Notes by: David Liu 1 Introduction The primary goal of complexity theory is to study the power
More informationWitnessing Matrix Identities and Proof Complexity
Witnessing Matrix Identities and Proof Complexity Fu Li Iddo Tzameret August 4, 2016 Abstract We use results from the theory of algebras with polynomial identities PI algebras to study the witness complexity
More informationTHE COMPLEXITY OF CONSTRUCTING PSEUDORANDOM GENERATORS FROM HARD FUNCTIONS
comput. complex. 13 (2004), 147 188 1016-3328/04/030147 42 DOI 10.1007/s00037-004-0187-1 c Birkhäuser Verlag, Basel 2004 computational complexity THE COMPLEXITY OF CONSTRUCTING PSEUDORANDOM GENERATORS
More informationON THE SIZE OF KAKEYA SETS IN FINITE FIELDS
ON THE SIZE OF KAKEYA SETS IN FINITE FIELDS ZEEV DVIR Abstract. A Kakeya set is a subset of F n, where F is a finite field of q elements, that contains a line in every direction. In this paper we show
More informationBlack Box Linear Algebra
Black Box Linear Algebra An Introduction to Wiedemann s Approach William J. Turner Department of Mathematics & Computer Science Wabash College Symbolic Computation Sometimes called Computer Algebra Symbols
More informationThe GCT chasm I. Ketan D. Mulmuley. The University of Chicago. The GCT chasm I p. 1
The GCT chasm I p. 1 The GCT chasm I Ketan D. Mulmuley The University of Chicago The GCT chasm I p. 2 The main reference GCT5 [M.]: Geometric Complexity Theory V: Equivalence between black-box derandomization
More informationSimplified Derandomization of BPP Using a Hitting Set Generator
Simplified Derandomization of BPP Using a Hitting Set Generator Oded Goldreich, Salil Vadhan, and Avi Wigderson Abstract. A hitting-set generator is a deterministic algorithm that generates a set of strings
More informationLast time, we described a pseudorandom generator that stretched its truly random input by one. If f is ( 1 2
CMPT 881: Pseudorandomness Prof. Valentine Kabanets Lecture 20: N W Pseudorandom Generator November 25, 2004 Scribe: Ladan A. Mahabadi 1 Introduction In this last lecture of the course, we ll discuss the
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 informationAlgorithms for Testing Monomials in Multivariate Polynomials arxiv: v1 [cs.cc] 15 Jul 2010
Algorithms for Testing Monomials in Multivariate Polynomials arxiv:1007.2675v1 [cs.cc] 15 Jul 2010 Zhixiang Chen Bin Fu Yang Liu Robert Schweller Department of Computer Science University of Texas-Pan
More informationSeparating Monotone VP and VNP
Electronic Colloquium on Computational Complexity, Report No. 124 (2018) Separating Monotone VP and VNP Amir Yehudayoff Abstract This work is about the monotone versions of the algebraic complexity classes
More informationTesting Booleanity and the Uncertainty Principle
Electronic Colloquium on Computational Complexity, Report No. 31 (2012) Testing Booleanity and the Uncertainty Principle Tom Gur and Omer Tamuz April 4, 2012 Abstract Let f : { 1, 1} n R be a real function
More informationSeparating multilinear branching programs and formulas
Separating multilinear branching programs and formulas Zeev Dvir Guillaume Malod Sylvain Perifel Amir Yehudayoff Abstract This work deals with the power of linear algebra in the context of multilinear
More informationA note on exponential circuit lower bounds from derandomizing Arthur-Merlin games
Electronic Colloquium on Computational Complexity, Report No. 74 (200) A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games Harry Buhrman Scott Aaronson MIT aaronson@csail.mit.edu
More informationThe Quantum Query Complexity of the Determinant
The Quantum Query Complexity of the Determinant Sebastian Dörn Inst. für Theoretische Informatik Universität Ulm 89069 Ulm, Germany Thomas Thierauf Fak. Elektronik und Informatik HTW Aalen 73430 Aalen,
More informationLOCALLY DECODABLE CODES WITH TWO QUERIES AND POLYNOMIAL IDENTITY TESTING FOR DEPTH 3 CIRCUITS
SIAM J. COMPUT. Vol. 36, No. 5, pp. 1404 1434 c 2007 Society for Industrial and Applied Mathematics LOCALLY DECODABLE CODES WITH TWO QUERIES AND POLYNOMIAL IDENTITY TESTING FOR DEPTH 3 CIRCUITS ZEEV DVIR
More informationMonomials, Multilinearity and Identity Testing in Simple Read-Restricted Circuits
Monomials, Multilinearity and Identity Testing in Simple Read-Restricted Circuits Meena Mahajan 1, B V Raghavendra Rao 2, and Karteek Sreenivasaiah 1 1 The Institute of Mathematical Sciences, Chennai 2
More informationTesting Algebraic Independence Of Polynomials Over Finite Fields
Testing Algebraic Independence Of Polynomials Over Finite Fields A thesis submitted in partial fulfillment of the requirements for the degree of Master of Technology by Amit Kumar Sinhababu Roll No: 12111010
More informationOn Uniform Amplification of Hardness in NP
On Uniform Amplification of Hardness in NP Luca Trevisan November 4, 2004 Abstract We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove
More informationLecture 16 Oct 21, 2014
CS 395T: Sublinear Algorithms Fall 24 Prof. Eric Price Lecture 6 Oct 2, 24 Scribe: Chi-Kit Lam Overview In this lecture we will talk about information and compression, which the Huffman coding can achieve
More informationTesting Booleanity and the Uncertainty Principle
Testing Booleanity and the Uncertainty Principle Tom Gur Weizmann Institute of Science tom.gur@weizmann.ac.il Omer Tamuz Weizmann Institute of Science omer.tamuz@weizmann.ac.il Abstract Let f : { 1, 1}
More informationCPSC 536N: Randomized Algorithms Term 2. Lecture 9
CPSC 536N: Randomized Algorithms 2011-12 Term 2 Prof. Nick Harvey Lecture 9 University of British Columbia 1 Polynomial Identity Testing In the first lecture we discussed the problem of testing equality
More information