Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth
Any attempt to find connections between mathematical properties and complexity has a strong relevance to the field of Complexity Theory. This is due to the lack of mathematical techniques to prove lower bounds for general models of computation.
This work represents a step in this direction: we define a combinatorial property that makes Boolean functions “hard” to compute and show how the harmonic analysis on the hypercube can be applied to derive new lower bounds on the size complexity of previously unclassified Boolean functions.
KeywordsBoolean Function Parity Function Combinatorial Property Constant Depth Spectral Characterization
Unable to display preview. Download preview PDF.
- 1.A. Bernasconi. On the Complexity of balanced Boolean Functions. CIAC’97, Lecture Notes in Computer Science 1203 (1997) pp. 253–263.Google Scholar
- 3.J. Håstad. Computational limitations for small depth circuits. Ph.D. Dissertation, MIT Press, Cambridge, Mass. (1986).Google Scholar
- 5.R. J. Lechner. Harmonic Analysis of Switching Functions. In Recent Development in Switching Theory, Academic Press (1971) pp. 122–229.Google Scholar
- 7.H. U. Simon. A tight ω(log log n) bound on the time for parallel RAM’s to compute nondegenerate Boolean functions. FCT’83, Lecture Notes in Computer Science 158 (1983).Google Scholar