License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2020.29
URN: urn:nbn:de:0030-drops-132703
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/13270/
Mande, Nikhil S. ;
Sanyal, Swagato
On Parity Decision Trees for Fourier-Sparse Boolean Functions
Abstract
We study parity decision trees for Boolean functions. The motivation of our study is the log-rank conjecture for XOR functions and its connection to Fourier analysis and parity decision tree complexity. Our contributions are as follows. Let f : ?₂ⁿ → {-1, 1} be a Boolean function with Fourier support ? and Fourier sparsity k.
- We prove via the probabilistic method that there exists a parity decision tree of depth O(√k) that computes f. This matches the best known upper bound on the parity decision tree complexity of Boolean functions (Tsang, Wong, Xie, and Zhang, FOCS 2013). Moreover, while previous constructions (Tsang et al., FOCS 2013, Shpilka, Tal, and Volk, Comput. Complex. 2017) build the trees by carefully choosing the parities to be queried in each step, our proof shows that a naive sampling of the parities suffices.
- We generalize the above result by showing that if the Fourier spectra of Boolean functions satisfy a natural "folding property", then the above proof can be adapted to establish existence of a tree of complexity polynomially smaller than O(√ k). More concretely, the folding property we consider is that for most distinct γ, δ in ?, there are at least a polynomial (in k) number of pairs (α, β) of parities in ? such that α+β = γ+δ. We make a conjecture in this regard which, if true, implies that the communication complexity of an XOR function is bounded above by the fourth root of the rank of its communication matrix, improving upon the previously known upper bound of square root of rank (Tsang et al., FOCS 2013, Lovett, J. ACM. 2016).
- Motivated by the above, we present some structural results about the Fourier spectra of Boolean functions. It can be shown by elementary techniques that for any Boolean function f and all (α, β) in binom(?,2), there exists another pair (γ, δ) in binom(?,2) such that α + β = γ + δ. One can view this as a "trivial" folding property that all Boolean functions satisfy. Prior to our work, it was conceivable that for all (α, β) ∈ binom(?,2), there exists exactly one other pair (γ, δ) ∈ binom(?,2) with α + β = γ + δ. We show, among other results, that there must exist several γ ∈ ?₂ⁿ such that there are at least three pairs of parities (α₁, α₂) ∈ binom(?,2) with α₁+α₂ = γ. This, in particular, rules out the possibility stated earlier.
BibTeX - Entry
@InProceedings{mande_et_al:LIPIcs:2020:13270,
author = {Nikhil S. Mande and Swagato Sanyal},
title = {{On Parity Decision Trees for Fourier-Sparse Boolean Functions}},
booktitle = {40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)},
pages = {29:1--29:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-174-0},
ISSN = {1868-8969},
year = {2020},
volume = {182},
editor = {Nitin Saxena and Sunil Simon},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13270},
URN = {urn:nbn:de:0030-drops-132703},
doi = {10.4230/LIPIcs.FSTTCS.2020.29},
annote = {Keywords: Parity decision trees, log-rank conjecture, analysis of Boolean functions, communication complexity}
}
|
Keywords: |
|
Parity decision trees, log-rank conjecture, analysis of Boolean functions, communication complexity |
|
Collection: |
|
40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020) |
|
Issue Date: |
|
2020 |
|
Date of publication: |
|
04.12.2020 |
