skip to main content
research-article

Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs

Published:10 January 2018Publication History
Skip Abstract Section

Abstract

Read-k oblivious algebraic branching programs are a natural generalization of the well-studied model of read-once oblivious algebraic branching program (ABP). In this work, we give an exponential lower bound of exp (n/kO(k)) on the width of any read-k oblivious ABP computing some explicit multilinear polynomial f that is computed by a polynomial-size depth-3 circuit. We also study the polynomial identity testing (PIT) problem for this model and obtain a white-box subexponential-time PIT algorithm. The algorithm runs in time 2Õ(n1−1/2k−1) and needs white box access only to know the order in which the variables appear in the ABP.

References

  1. Manindra Agrawal. 2005. Proving lower bounds via pseudo-random generators. In Proceedings of the 25th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2005). 92--105. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Manindra Agrawal, Rohit Gurjar, Arpita Korwar, and Nitin Saxena. 2015. Hitting-sets for ROABP and sum of set-multilinear circuits. SIAM J. Comput. 44, 3 (2015), 669--697. arXiv:1406.7535Google ScholarGoogle ScholarCross RefCross Ref
  3. Manindra Agrawal and V. Vinay. 2008. Arithmetic circuits: A chasm at depth four. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008). 67--75. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Martin Aigner and Günter M. Ziegler. 2004. Proofs from THE BOOK. Springer.Google ScholarGoogle Scholar
  5. Miklós Ajtai. 2005. A non-linear time lower bound for Boolean branching programs. Theory of Computing 1, 1 (2005), 149--176. Retrieved fromGoogle ScholarGoogle ScholarCross RefCross Ref
  6. Noga Alon, Zoltán Füredi, and Meir Katchalski. 1985. Separating pairs of points by standard boxes. Eur. J. Combinator. 6, 3 (1985), 205--210.Google ScholarGoogle ScholarCross RefCross Ref
  7. Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, and Ben Lee Volk. 2016. Identity testing and lower bounds for read-k oblivious algebraic branching programs. In Proceedings of the of the 31st Annual Computational Complexity Conference (CCC 2016), Vol. 50. 30:1--30:25. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Matthew Anderson, Dieter van Melkebeek, and Ilya Volkovich. 2015. Deterministic polynomial identity tests for multilinear bounded-read formulae. Comput. Complex. 24, 4 (2015), 695--776. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Vikraman Arvind and S. Raja. 2016. Some lower bound results for set-multilinear arithmetic computations. Chicago J. Theoret. Comput. Sci. Retrieved from http://cjtcs.cs.uchicago.edu/articles/2016/6/contents.html.Google ScholarGoogle Scholar
  10. László Babai, Péter Hajnal, Endre Szemerédi, and György Turán. 1987. A lower bound for read-once-only branching programs. J. Comput. Syst. Sci. 35, 2 (1987), 153--162. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Paul Beame, Michael E. Saks, Xiaodong Sun, and Erik Vee. 2003. Time-space trade-off lower bounds for randomized computation of decision problems. J. ACM 50, 2 (2003), 154--195. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Andrej Bogdanov, Zeev Dvir, Elad Verbin, and Amir Yehudayoff. 2013. Pseudorandomness for width-2 branching programs. Theory Comput. 9 (2013), 283--293.Google ScholarGoogle ScholarCross RefCross Ref
  13. Andrej Bogdanov, Periklis A. Papakonstantinou, and Andrew Wan. 2011. Pseudorandomness for read-once formulas. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2011). 240--246. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Allan Borodin, Alexander A. Razborov, and Roman Smolensky. 1993. On lower bounds for read--times branching programs. Comput. Complex. 3 (1993), 1--18. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Mark Braverman, Anup Rao, Ran Raz, and Amir Yehudayoff. 2014. Pseudorandom generators for regular branching programs. SIAM J. Comput. 43, 3 (2014), 973--986.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Anindya De. 2011. Pseudorandomness for permutation and regular branching programs. In Proceedings of the 26th Annual IEEE Conference on Computational Complexity (CCC 2011). 221--231. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Richard A. DeMillo and Richard J. Lipton. 1978. A probabilistic remark on algebraic program testing. Inform. Process. Lett. 7, 4 (1978), 193--195.Google ScholarGoogle ScholarCross RefCross Ref
  18. Zeev Dvir and Amir Shpilka. 2007. Locally decodable codes with two queries and polynomial identity testing for depth 3 circuits. SIAM J. Comput. 36, 5 (2007), 1404--1434. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Zeev Dvir, Amir Shpilka, and Amir Yehudayoff. 2009. Hardness-randomness tradeoffs for bounded depth arithmetic circuits. SIAM J. Comput. 39, 4 (2009), 1279--1293.Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Paul Erdős and George Szekeres. 1935. A combinatorial problem in geometry. Compositio Math. 2 (1935), 463--470.Google ScholarGoogle Scholar
  21. Michael Forbes. 2014. Polynomial Identity Testing of Read-Once Oblivious Algebraic Branching Programs. Ph.D. Dissertation. Massachusetts Institute of Technology. Retrieved from http://hdl.handle.net/1721.1/89843Google ScholarGoogle Scholar
  22. Michael A. Forbes, Ramprasad Saptharishi, and Amir Shpilka. 2014. Hitting sets for multilinear read-once algebraic branching programs, in any order. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC 2014). 867--875. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Michael A. Forbes and Amir Shpilka. 2013. Explicit noether normalization for simultaneous conjugation via polynomial identity testing. In Proceedings of the 17th International Workshop on Randomization and Computation (RANDOM 2013) (Lecture Notes in Computer Science), Vol. 8096. Springer, 527--542.Google ScholarGoogle Scholar
  24. Michael A. Forbes and Amir Shpilka. 2013. Quasipolynomial-time identity testing of non-commutative and read-once oblivious algebraic branching programs. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013). 243--252. Full version at arXiv:1209.2408. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Hervé Fournier, Nutan Limaye, Guillaume Malod, and Srikanth Srinivasan. 2014. Lower bounds for depth 4 formulas computing iterated matrix multiplication. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC 2014). 128--135. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, and Salil P. Vadhan. 2012. Better pseudorandom generators from milder pseudorandom restrictions. In Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012). IEEE Computer Society, 120--129. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Ankit Gupta, Pritish Kamath, Neeraj Kayal, and Ramprasad Saptharishi. 2013. Arithmetic circuits: A chasm at depth three. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013). 578--587. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Ankit Gupta, Pritish Kamath, Neeraj Kayal, and Ramprasad Saptharishi. 2014. Approaching the chasm at depth four. J. ACM 61, 6 (2014), 33:1--33:16. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Rohit Gurjar, Arpita Korwar, Nitin Saxena, and Thomas Thierauf. 2016. Deterministic identity testing for sum of read-once oblivious arithmetic branching programs. Comput. Complex. (2016), 1--46. arXiv:1411.7341 Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Joos Heintz and Claus-Peter Schnorr. 1980. Testing polynomials which are easy to compute (extended abstract). In Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC 1980). 262--272. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Russell Impagliazzo, Raghu Meka, and David Zuckerman. 2012. Pseudorandomness from shrinkage. In Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012). 111--119. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Russell Impagliazzo, Noam Nisan, and Avi Wigderson. 1994. Pseudorandomness for network algorithms. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC 1994). 356--364. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Maurice J. Jansen, Youming Qiao, and Jayalal Sarma. 2010. Deterministic black-box identity testing $pi$-ordered algebraic branching programs. In Proceedings of the 30th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), Vol. 8. 296--307.Google ScholarGoogle Scholar
  34. Maurice J. Jansen, Youming Qiao, and Jayalal Sarma. 2010. Deterministic identity testing of read-once algebraic branching programs. Electron. Colloq. Comput. Complex. (ECCC) 17 (2010), 84.Google ScholarGoogle Scholar
  35. Valentine Kabanets and Russell Impagliazzo. 2004. Derandomizing polynomial identity tests means proving circuit lower bounds. Comput. Complex. 13, 1--2 (2004), 1--46. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, and Ilya Volkovich. 2013. Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in. SIAM J. Comput. 42, 6 (2013), 2114--2131.Google ScholarGoogle ScholarCross RefCross Ref
  37. Richard M. Karp, Eli Upfal, and Avi Wigderson. 1986. Constructing a perfect matching is in random NC. Combinatorica 6, 1 (1986), 35--48. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Neeraj Kayal, Nutan Limaye, Chandan Saha, and Srikanth Srinivasan. 2014. An exponential lower bound for homogeneous depth four arithmetic circuits. In Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014). Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Neeraj Kayal, Vineet Nair, and Chandan Saha. 2016. Separation between read-once oblivious algebraic branching programs (ROABPs) and multilinear depth three circuits. In Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016) (LIPIcs), Vol. 47. 46:1--46:15.Google ScholarGoogle Scholar
  40. Neeraj Kayal, Chandan Saha, and Ramprasad Saptharishi. 2014. A super-polynomial lower bound for regular arithmetic formulas. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC 2014). 146--153. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. Neeraj Kayal and Shubhangi Saraf. 2009. Blackbox polynomial identity testing for depth- circuits. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009). Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. Neeraj Kayal and Nitin Saxena. 2007. Polynomial identity testing for depth 3 circuits. Comput. Complex. 16, 2 (2007), 115--138. Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. Pascal Koiran. 2012. Arithmetic circuits: The chasm at depth four gets wider. Theoret. Comput. Sci. 448 (2012), 56--65. Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. Swastik Kopparty, Shubhangi Saraf, and Amir Shpilka. 2015. Equivalence of polynomial identity testing and polynomial factorization. Comput. Complex. 24, 2 (2015), 295--331. Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. Michal Koucký, Prajakta Nimbhorkar, and Pavel Pudlák. 2011. Pseudorandom generators for group products: Extended abstract. In Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC 2011). 263--272. Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. Joseph B. Kruskal. 1953. Monotonic subsequences. Proc. Amer. Math. Soc. 4, 2 (1953), 264--274.Google ScholarGoogle ScholarCross RefCross Ref
  47. Mrinal Kumar and Shubhangi Saraf. 2014. The limits of depth reduction for arithmetic formulas: It’s all about the top fan-in. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC 2014). 136--145. Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. Mrinal Kumar and Shubhangi Saraf. 2014. On the power of homogeneous depth arithmetic circuits. In Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014). Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. Daniel Minahan and Ilya Volkovich. 2017. Complete derandomization of identity testing and reconstruction of read-once formulas. In Proceedings of the 32nd Annual Computational Complexity Conference (CCC 2017). Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. Ketan Mulmuley. 2012. Geometric complexity theory v: Equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether’s normalization lemma. In Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012). 629--638. Google ScholarGoogle ScholarDigital LibraryDigital Library
  51. Ketan Mulmuley, Umesh V. Vazirani, and Vijay V. Vazirani. 1987. Matching is as easy as matrix inversion. Combinatorica 7, 1 (1987), 105--113. Google ScholarGoogle ScholarDigital LibraryDigital Library
  52. Noam Nisan. 1991. Lower bounds for non-commutative computation. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC 1991). 410--418. Google ScholarGoogle ScholarDigital LibraryDigital Library
  53. Noam Nisan. 1992. Pseudorandom generators for space-bounded computation. Combinatorica 12, 4 (1992), 449--461.Google ScholarGoogle ScholarCross RefCross Ref
  54. Noam Nisan and Avi Wigderson. 1994. Hardness vs randomness. J. Comput. Syst. Sci. 49, 2 (1994), 149--167. Google ScholarGoogle ScholarDigital LibraryDigital Library
  55. E. A. Okolnishnikova. 1991. Lower bounds on the complexity of realization of characteristic functions of binary codes by branching programs. Metody Diskretnogo Analiza 51 (1991), 61--83.Google ScholarGoogle Scholar
  56. Rafael Oliveira, Amir Shpilka, and Ben Lee Volk. 2015. Subexponential size hitting sets for bounded depth multilinear formulas. In Proceedings of the 30th Annual Computational Complexity Conference (CCC 2015). 304--322. arXiv:1411.7492 Google ScholarGoogle ScholarDigital LibraryDigital Library
  57. Ran Raz and Amir Shpilka. 2005. Deterministic polynomial identity testing in non-commutative models. Comput. Complex. 14, 1 (2005), 1--19. Google ScholarGoogle ScholarDigital LibraryDigital Library
  58. Ran Raz and Amir Yehudayoff. 2009. Lower bounds and separations for constant depth multilinear circuits. Comput. Complex. 18, 2 (2009), 171--207.Google ScholarGoogle ScholarCross RefCross Ref
  59. Omer Reingold, Thomas Steinke, and Salil P. Vadhan. 2013. Pseudorandomness for regular branching programs via fourier analysis. In Proceedings of the 17th International Workshop on Randomization and Computation (RANDOM 2013). 655--670.Google ScholarGoogle Scholar
  60. Shubhangi Saraf and Ilya Volkovich. 2011. Black-box identity testing of depth-4 multilinear circuits. In Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC 2011). 421--430. Google ScholarGoogle ScholarDigital LibraryDigital Library
  61. Nitin Saxena and C. Seshadhri. 2012. Blackbox identity testing for bounded top-fanin depth-3 circuits: The field doesn’t matter. SIAM J. Comput. 41, 5 (2012), 1285--1298.Google ScholarGoogle ScholarCross RefCross Ref
  62. Jacob T. Schwartz. 1980. Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27, 4 (1980), 701--717. Google ScholarGoogle ScholarDigital LibraryDigital Library
  63. Amir Shpilka and Ilya Volkovich. 2010. On the relation between polynomial identity testing and finding variable disjoint factors. In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP 2010). 408--419. Google ScholarGoogle ScholarDigital LibraryDigital Library
  64. Amir Shpilka and Ilya Volkovich. 2015. Read-once polynomial identity testing. Comput. Complex. 24, 3 (2015), 477--532. Google ScholarGoogle ScholarDigital LibraryDigital Library
  65. Amir Shpilka and Amir Yehudayoff. 2010. Arithmetic circuits: A survey of recent results and open questions. Found. Trends Theoret. Comput. Sci. 5 (March 2010), 207--388. Issue 38#8211;4. Google ScholarGoogle ScholarDigital LibraryDigital Library
  66. Thomas Steinke. 2012. Pseudorandomness for permutation branching programs without the group theory. Electron. Colloq. Comput. Complex. (ECCC) 19 (2012), 83.Google ScholarGoogle Scholar
  67. Thomas Steinke, Salil P. Vadhan, and Andrew Wan. 2014. Pseudorandomness and fourier growth bounds for width-3 branching programs. In Proceedings of the 18th International Workshop on Randomization and Computation (RANDOM 2014). 885--899.Google ScholarGoogle Scholar
  68. Sébastien Tavenas. 2015. Improved bounds for reduction to depth 4 and depth 3. Inf. Comput. 240 (2015), 2--11. Google ScholarGoogle ScholarDigital LibraryDigital Library
  69. Jayram S. Thathachar. 1998. On separating the read-k-times branching program hierarchy. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC 1998). 653--662. Google ScholarGoogle ScholarDigital LibraryDigital Library
  70. Leslie G. Valiant, Sven Skyum, S. Berkowitz, and Charles Rackoff. 1983. Fast parallel computation of polynomials using few processors. SIAM J. Comput. 12, 4 (1983), 641--644.Google ScholarGoogle ScholarDigital LibraryDigital Library
  71. Ingo Wegener. 1988. On the complexity of branching programs and decision trees for clique functions. J. ACM 35, 2 (1988), 461--471. Google ScholarGoogle ScholarDigital LibraryDigital Library
  72. Stanislav Zák. 1984. An exponential lower bound for one-time-only branching programs. In Proceedings of the 9th International Symposium on the Mathematical Foundations of Computer Science (MFCS 1984) (Lecture Notes in Computer Science), Vol. 176. Springer, 562--566. Google ScholarGoogle ScholarDigital LibraryDigital Library
  73. Richard Zippel. 1979. Probabilistic algorithms for sparse polynomials. In Proceedings of the International Symposium on Symbolic and Algebraic Computation (EUROSAM’79), Lecture Notes in Computer Science, Vol. 72. Springer, 216--226. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!