On the parity complexity measures of Boolean functions
From MaRDI portal
Publication:974756
DOI10.1016/j.tcs.2010.03.027zbMath1207.68170MaRDI QIDQ974756
Publication date: 7 June 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.027
68Q25: Analysis of algorithms and problem complexity
Related Items
Structure of Protocols for XOR Functions, Property testing lower bounds via a generalization of randomized parity decision trees, On the structure of Boolean functions with small spectral norm, Alternation, sparsity and sensitivity: bounds and exponential gaps
Cites Work