DagSemProc.06111.5.pdf
- Filesize: 297 kB
- 9 pages
We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an asymptotically ``flat'' Fourier spectrum and thus implies several lower bounds of its various complexity measures.
Feedback for Dagstuhl Publishing