research-article

Public Access

The Complexity of DNF of Parities

Authors:

Igor ShinkarAuthors Info & Claims

ITCS '16: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science

Pages 47 - 58

https://doi.org/10.1145/2840728.2840734

Published: 14 January 2016 Publication History

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-n^o(1)} lower bound.

We give a non-trivial general upper bound by showing that DNFParity(f) < O(2^{n / 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.5^{n 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 Ω(2^n/4) for the DNFParity complexity of this function. We further give bounds for any low degree polynomial.

Finally, we obtain a 2^n-o(n) average case lower bound for the parity decision tree model using affine extractors.

References

[1]

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.

Digital Library

[2]

N. Alon and G. Cohen. On rigid matrices and U-polynomials. In Conference on Computational Complexity (CCC), 2013 IEEE, pages 197--206. IEEE, 2013.

[3]

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.

[4]

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.

Digital Library

[5]

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.

Digital Library

[6]

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.

Digital Library

[7]

N. Blum. A boolean function requiring 3n network size. Theoretical Computer Science, 28(3):337--345, 1983.

[8]

J. Bourgain. On the construction of affine extractors. GAFA Geometric And Functional Analysis, 17(1):33--57, 2007.

[9]

E. Ben-Sasson and S. Kopparty. Affine dispersers from subspace polynomials. SIAM Journal on Computing, 41(4):880--914, 2012.

[10]

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.

Digital Library

[11]

T. M. Cover and A. J. Thomas. Elements of information theory. John Wiley & Sons, 2012.

Digital Library

[12]

G. Cohen and A. Tal. Two structural results for low degree polynomials and applications. arXiv preprint arXiv:1404.0654, 2014.

[13]

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.

[14]

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.

Digital Library

[15]

A. Ehrenfeucht and D. Haussler. Learning decision trees from random examples. Information and Computation, 82(3):231--246, 1989.

Digital Library

[16]

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.

Digital Library

[17]

J. Hartmanis and L. A. Hemachandra. One-way functions and the nonisomorphism of NP-complete sets. Theoretical Computer Science, 81(1):155--163, 1991.

Digital Library

[18]

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.

Digital Library

[19]

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.

Digital Library

[20]

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.

Digital Library

[21]

S. Jukna. On graph complexity. Combinatorics, Probability and Computing, 15(06):855--876, 2006.

Digital Library

[22]

S. Jukna. Boolean function complexity: advances and frontiers, volume 27. Springerverlag Berlin Heidelberg, 2012.

Digital Library

[23]

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.

Digital Library

[24]

E. Kushilevitz and Y. Mansour. Learning decision trees using the fourier spectrum. SIAM J. Comput., 22(6):1331--1348, 1993.

Digital Library

[25]

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.

Digital Library

[26]

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.

[27]

A. Montanaro and T. Osborne. On the communication complexity of XOR functions. arXiv preprint arXiv:0909.3392, 2009.

[28]

R. O'Donnell. Analysis of boolean functions. Cambridge University Press, 2014.

Digital Library

[29]

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.

[30]

P. Pudlák and V. Rödl. Pseudorandom sets and explicit constructions of Ramsey graphs. Quad. Mat, 13:327--346, 2004.

[31]

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.

Digital Library

[32]

W. Quine. Two theorems about truth functions. Sociedade Matematica Mexicana, 1953.

[33]

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.

Digital Library

[34]

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.

Digital Library

[35]

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.

[36]

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.

Digital Library

[37]

R. A. Servedio and E. Viola. On a special case of rigidity. 2012. http://eccc.hpi-web.de/report/2012/144/.

[38]

G. Tardos. Query complexity, or why is it difficult to separate NP^A ∩ coNP^A from P^A by random a oracle A Combinatorica, 9(4):385--392, 1989.

[39]

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.

[40]

E. Viola. Extractors for circuit sources. SIAM Journal on Computing, 43(2):655--672, 2014.

[41]

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.

Digital Library

[42]

A. Yehudayoff. Affine extractors over prime fields. Combinatorica, 31(2):245--256, 2011.

Digital Library

[43]

Z. Zhang and Y. Shi. On the parity complexity measures of boolean functions. Theoretical Computer Science, 411(26):2612--2618, 2010.

Digital Library

Cited By

Chattopadhyay ELiao J(2023)Hardness against Linear Branching Programs and MoreProceedings of the conference on Proceedings of the 38th Computational Complexity Conference10.4230/LIPIcs.CCC.2023.9(1-27)Online publication date: 17-Jul-2023
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2023.9
Gryaznov SPudlák PTalebanfard N(2022)Linear branching programs and directional affine extractorsProceedings of the 37th Computational Complexity Conference10.4230/LIPIcs.CCC.2022.4(1-16)Online publication date: 20-Jul-2022
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2022.4
Oliveira ISanthanam RTell R(2022)Expander-Based Cryptography Meets Natural ProofsComputational Complexity10.1007/s00037-022-00220-x31:1Online publication date: 16-Mar-2022
https://dl.acm.org/doi/10.1007/s00037-022-00220-x
Show More Cited By

Index Terms

The Complexity of DNF of Parities

Recommendations

Exact learning of DNF formulas using DNF hypotheses
Special issue on COLT 2002

We 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 Conference

A natural model of read-once linear branching programs is a branching program where queries are F₂ 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

Information & Contributors

Information

Published In

cover image ACM Conferences

ITCS '16: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science

January 2016

422 pages

ISBN:9781450340571

DOI:10.1145/2840728

Program Chair:
Madhu Sudan
Harvard University

Copyright © 2016 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 January 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

ITCS'16

Sponsor:

SIGACT

ITCS'16: Innovations in Theoretical Computer Science

January 14 - 17, 2016

Massachusetts, Cambridge, USA

Acceptance Rates

ITCS '16 Paper Acceptance Rate 40 of 145 submissions, 28%;

Overall Acceptance Rate 172 of 513 submissions, 34%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
528
Total Downloads

Downloads (Last 12 months)77
Downloads (Last 6 weeks)19

Reflects downloads up to 02 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chattopadhyay ELiao J(2023)Hardness against Linear Branching Programs and MoreProceedings of the conference on Proceedings of the 38th Computational Complexity Conference10.4230/LIPIcs.CCC.2023.9(1-27)Online publication date: 17-Jul-2023
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2023.9
Gryaznov SPudlák PTalebanfard N(2022)Linear branching programs and directional affine extractorsProceedings of the 37th Computational Complexity Conference10.4230/LIPIcs.CCC.2022.4(1-16)Online publication date: 20-Jul-2022
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2022.4
Oliveira ISanthanam RTell R(2022)Expander-Based Cryptography Meets Natural ProofsComputational Complexity10.1007/s00037-022-00220-x31:1Online publication date: 16-Mar-2022
https://dl.acm.org/doi/10.1007/s00037-022-00220-x
Aggarwal DBennett HGolovnev AStephens-Davidowitz NMarx D(2021)Fine-grained hardness of CVP(P)Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458173(1816-1835)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458173
Girish UTal AWu K(2021)Fourier growth of parity decision treesProceedings of the 36th Computational Complexity Conference10.4230/LIPIcs.CCC.2021.39Online publication date: 20-Jul-2021
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2021.39
Bun MKothari RThaler J(2021)Quantum algorithms and approximating polynomials for composed functions with shared inputsQuantum10.22331/q-2021-09-16-5435(543)Online publication date: 16-Sep-2021
https://doi.org/10.22331/q-2021-09-16-543
Ilango RLoff BOliveira IAceto L(2020)NP-hardness of circuit minimization for multi-output functionsProceedings of the 35th Computational Complexity Conference10.4230/LIPIcs.CCC.2020.22(1-36)Online publication date: 28-Jul-2020
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2020.22
Hirahara SOliveira ISanthanam RServedio R(2018)NP-hardness of minimum circuit size problem for OR-AND-MOD circuitsProceedings of the 33rd Computational Complexity Conference10.5555/3235586.3235591(1-31)Online publication date: 22-Jun-2018
https://dl.acm.org/doi/10.5555/3235586.3235591
Lokshtanov DPaturi RTamaki SWilliams RYu HKlein P(2017)Beating brute force for systems of polynomial equations over finite fieldsProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039829(2190-2202)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039829

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents