New answers tagged boolean-functions
0
votes
Finding an $\epsilon$-concentrated collection with size in terms of spectral $1$-norm
Here is a direct construction:
$$F = \left\{S:|\hat{f}(S)|\ge \frac{\epsilon}{\hat{\|}f\hat{\|}_1}\right\}$$
And you can verify the two conditions.
4
votes
Accepted
Intuition on Lupanov's Upper Bound on Circuit Size
Yes, there is a simpler construction, essentially due to Shannon.
For every $k$, all $2^{2^k}$ functions on $k$ variables can implemented by a circuit of size $2^{2^k}$ (just take some implementation ...
Top 50 recent answers are included
Related Tags
boolean-functions × 217cc.complexity-theory × 74
fourier-analysis × 47
circuit-complexity × 45
co.combinatorics × 28
reference-request × 21
lg.learning × 17
boolean-formulas × 15
sat × 12
lower-bounds × 11
lo.logic × 8
machine-learning × 8
circuits × 8
graph-theory × 7
polynomials × 7
monotone × 7
time-complexity × 6
arithmetic-circuits × 6
complexity-classes × 5
quantum-computing × 5
it.information-theory × 5
communication-complexity × 5
pseudorandomness × 5
combinatorics × 5
pac-learning × 5