Gil Cohen
ABSTRACT
We study depth 3 circuits of the form OR-AND-XOR, or equivalently -- DNF of parities. This model was first explicitly studied by Jukna (CPC'06) who obtained a 2{Ω(n) lower bound, using graph theoretic arguments, for explicit functions. Several related models have gained attention in the last few years, such as parity decision trees, the parity kill number and AC0-XOR circuits.
For a Boolean function f on the n dimensional Boolean cube, we denote by DNFParity(f) the least integer s for which there exists an OR-AND-XOR circuit, with OR gate of fan-in s, that computes f. We summarize some of our results:
For any affine disperser f for dimension k, it holds that DNFParity(f) is bounded below by 2{n-2k. By plugging Shaltiel's affine disperser (FOCS'11) we obtain an explicit 2{n-no(1) lower bound.
We give a non-trivial general upper bound by showing that DNFParity(f) < O(2n / n) for any function f on n bits. This bound is shown to be tight up to an O(log n) factor.
We show that for any symmetric function f it holds that DNFParity(f) < 1.5n poly(n). Furthermore, there exists a symmetric function f for which this bound is tight up to a polynomial factor.
For threshold functions we show tighter bounds. For example, we show that the majority function has DNFParity complexity of 2{n/2 poly(n). This is also tight up to a polynomial factor.
For the inner product function IP on n inputs we show that DNFParity(IP) = 2{n/2}-1. Previously, Jukna gave a lower bound of Ω(2n/4) for the DNFParity complexity of this function. We further give bounds for any low degree polynomial.
Finally, we obtain a 2n-o(n) average case lower bound for the parity decision tree model using affine extractors.
- A. Akavia, A. Bogdanov, S. Guo, A. Kamath, and A. Rosen. Candidate weak pseudorandom functions in AC0 MOD2. In Proceedings of the 5th conference on Innovations in theoretical computer science, pages 251--260. ACM, 2014. Google Scholar
Digital Library
- N. Alon and G. Cohen. On rigid matrices and U-polynomials. In Conference on Computational Complexity (CCC), 2013 IEEE, pages 197--206. IEEE, 2013.Google ScholarCross Ref
- V. Arvind and S. Srinivasan. The remote point problem, small bias space, and expanding generator sets. In 27th International Symposium on Theoretical Aspects of Computer Science-STACS 2010, pages 59--70, 2010.Google Scholar
- I. Ben-Eliezer, R. Hod, and S. Lovett. Random low degree polynomials are hard to approximate. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 366--377. Springer, 2009. Google ScholarDigital Library
- M. Blum and R. Impagliazzo. Generic oracles and oracle classes. In 28th Annual Symposium on Foundations of Computer Science, 1987., pages 118--126. IEEE, 1987. Google ScholarDigital Library
- B. Barak, G. Kindler, R. Shaltiel, B. Sudakov, and A. Wigderson. Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors. In Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pages 1--10. ACM, 2005. Google ScholarDigital Library
- N. Blum. A boolean function requiring 3n network size. Theoretical Computer Science, 28(3):337--345, 1983.Google ScholarCross Ref
- J. Bourgain. On the construction of affine extractors. GAFA Geometric And Functional Analysis, 17(1):33--57, 2007.Google ScholarCross Ref
- E. Ben-Sasson and S. Kopparty. Affine dispersers from subspace polynomials. SIAM Journal on Computing, 41(4):880--914, 2012.Google ScholarCross Ref
- E. Ben-Sasson and N. Zewi. From affine to two-source extractors via approximate duality. In Proceedings of the 43rd annual ACM symposium on Theory of computing, pages 177--186. ACM, 2011. Google ScholarDigital Library
- T. M. Cover and A. J. Thomas. Elements of information theory. John Wiley & Sons, 2012.Google ScholarDigital Library
- G. Cohen and A. Tal. Two structural results for low degree polynomials and applications. arXiv preprint arXiv:1404.0654, 2014.Google Scholar
- L. E. Dickson. Linear groups with an exposition of the Galois field theory. B.G Teubner's Sammlung von Lehrbuchern auf dem Gebiete der mathematischen Wissenschaften mit Einschluss ihrer Anwendungen. B.G. Teubner, 1901.Google Scholar
- E. Demenkov and A. S. Kulikov. An elementary proof of a 3n-o(n) lower bound on the circuit complexity of affine dispersers. In Mathematical Foundations of Computer Science 2011, pages 256--265. Springer, 2011. Google ScholarDigital Library
- A. Ehrenfeucht and D. Haussler. Learning decision trees from random examples. Information and Computation, 82(3):231--246, 1989. Google ScholarDigital Library
- V. Grolmusz. A weight-size trade-off for circuits with MOD m gates. In Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, pages 68--74. ACM, 1994. Google ScholarDigital Library
- J. Hartmanis and L. A. Hemachandra. One-way functions and the nonisomorphism of NP-complete sets. Theoretical Computer Science, 81(1):155--163, 1991. Google ScholarDigital Library
- E. Haramaty and A. Shpilka. On the structure of cubic and quartic polynomials. In Proceedings of the 42nd ACM symposium on Theory of computing, pages 331--340. ACM, 2010. Google ScholarDigital Library
- J. C. Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. Journal of Computer and System Sciences, 55(3):414--440, 1997. Google ScholarDigital Library
- S. Jukna, A. Razborov, P. Savickỳ, and I. Wegener. On P versus NP ∩ co-NP for decision trees and read-once branching programs. Computational Complexity, 8(4):357--370, 1999. Google ScholarDigital Library
- S. Jukna. On graph complexity. Combinatorics, Probability and Computing, 15(06):855--876, 2006. Google ScholarDigital Library
- S. Jukna. Boolean function complexity: advances and frontiers, volume 27. Springerverlag Berlin Heidelberg, 2012. Google ScholarDigital Library
- T. Kaufman and S. Lovett. Worst case to average case reductions for polynomials. In Foundations of Computer Science (FOCS), 2008 49th Annual IEEE Symposium on, pages 166--175. IEEE, 2008. Google ScholarDigital Library
- E. Kushilevitz and Y. Mansour. Learning decision trees using the fourier spectrum. SIAM J. Comput., 22(6):1331--1348, 1993. Google ScholarDigital Library
- X. Li. A new approach to affine extractors and dispersers. In Computational Complexity (CCC), 2011 IEEE 26th Annual Conference on, pages 137--147. IEEE, 2011. Google ScholarDigital Library
- O. Lupanov. On realization of functions of propositional calculus by formulas of bounded depth over the basis &,vee,neg. Dokl. Akad. Nauk SSSR, 136(5):1041--1042, 1961.Google Scholar
- A. Montanaro and T. Osborne. On the communication complexity of XOR functions. arXiv preprint arXiv:0909.3392, 2009.Google Scholar
- R. O'Donnell. Analysis of boolean functions. Cambridge University Press, 2014. Google ScholarDigital Library
- R. O'Donnell, X. Sun, L. Y. Tan, J. Wright, and Y. Zhao. A composition theorem for parity kill number. arXiv preprint arXiv:1312.2143, 2013.Google Scholar
- P. Pudlák and V. Rödl. Pseudorandom sets and explicit constructions of Ramsey graphs. Quad. Mat, 13:327--346, 2004.Google Scholar
- R. Paturi, M. E. Saks, and F. Zane. Exponential lower bounds for depth 3 boolean circuits. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 86--91. ACM, 1997. Google ScholarDigital Library
- W. Quine. Two theorems about truth functions. Sociedade Matematica Mexicana, 1953.Google Scholar
- R. Shaltiel. Dispersers for affine sources with sub-polynomial entropy. In Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on, pages 247--256. IEEE, 2011. Google ScholarDigital Library
- K. Seto and S. Tamaki. A satisfiability algorithm and average-case hardness for formulas over the full binary basis. In Computational Complexity (CCC), 2012 IEEE 27th Annual Conference on, pages 107--116. IEEE, 2012. Google ScholarDigital Library
- K. Seto and S. Tamaki. A satisfiability algorithm and average-case hardness for formulas over the full binary basis. Computational Complexity, 22(2):245--274, 2013.Google ScholarCross Ref
- A. Shpilka, A. Tal, and B. Volk. On the structure of boolean functions with small spectral norm. In Proceedings of the 5th conference on Innovations in theoretical computer science, pages 37--48. ACM, 2014. Google ScholarDigital Library
- R. A. Servedio and E. Viola. On a special case of rigidity. 2012. http://eccc.hpi-web.de/report/2012/144/.Google Scholar
- G. Tardos. Query complexity, or why is it difficult to separate NPA ∩ coNPA from PA by random a oracle A Combinatorica, 9(4):385--392, 1989.Google Scholar
- H. Y. Tsang, C. H. Wong, N. Xie, and S. Zhang. Fourier sparsity, spectral norm, and the log-rank conjecture. arXiv preprint arXiv:1304.1245, 2013.Google Scholar
- E. Viola. Extractors for circuit sources. SIAM Journal on Computing, 43(2):655--672, 2014.Google ScholarCross Ref
- E. Viola and A. Wigderson. Norms, XOR lemmas, and lower bounds for GF(2) polynomials and multiparty protocols. In Computational Complexity, 2007. CCC'07. Twenty-Second Annual IEEE Conference on, pages 141--154. IEEE, 2007. Google ScholarDigital Library
- A. Yehudayoff. Affine extractors over prime fields. Combinatorica, 31(2):245--256, 2011. Google ScholarDigital Library
- Z. Zhang and Y. Shi. On the parity complexity measures of boolean functions. Theoretical Computer Science, 411(26):2612--2618, 2010. Google ScholarDigital Library
Index Terms
- The Complexity of DNF of Parities
Recommendations
Exact learning of DNF formulas using DNF hypotheses
Special issue on COLT 2002We show the following: (a) For any @e>0, log^(^3^+^@e^)n-term DNF cannot be polynomial-query learned with membership and strongly proper equivalence queries. (b) For sufficiently large t, t-term DNF formulas cannot be polynomial-query learned with ...
Linear branching programs and directional affine extractors
CCC '22: Proceedings of the 37th Computational Complexity ConferenceA natural model of read-once linear branching programs is a branching program where queries are F2 linear forms, and along each path, the queries are linearly independent. We consider two restrictions of this model, which we call weakly and strongly ...
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider two standard variants of this problem. The first one is two-level logic ...
Comments