Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth

Authors:
Anna Bernasconi
Affiliations:
-
Venue:
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Year:
1998

Citing 4
Cited 0

The complexity of Boolean functions

The complexity of Boolean functions
Constant depth circuits, Fourier transform, and learnability

Journal of the ACM (JACM)
On the Complexity of Balanced Boolean Functions

CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
A Tight Omega(loglog n)-Bound on the Time for Parallel Ram's to Compute Nondegenerated Boolean Functions

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.