License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-6171
URL: http://drops.dagstuhl.de/opus/volltexte/2006/617/
Go to the corresponding Portal


Shparlinski, Igor E.

Bounds on the Fourier Coefficients of the Weighted Sum Function

pdf-format:
Document 1.pdf (298 KB)


Abstract

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.

BibTeX - Entry

@InProceedings{shparlinski:DSP:2006:617,
  author =	{Igor E. Shparlinski},
  title =	{Bounds on the Fourier Coefficients of the Weighted Sum Function},
  booktitle =	{Complexity of Boolean Functions},
  year =	{2006},
  editor =	{Matthias Krause and Pavel Pudl{\'a}k and R{\"u}diger Reischuk and Dieter van Melkebeek},
  number =	{06111},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/617},
  annote =	{Keywords: Fourier coefficients, congruences, average sensitivity, decision tree}
}

Keywords: Fourier coefficients, congruences, average sensitivity, decision tree
Seminar: 06111 - Complexity of Boolean Functions
Issue Date: 2006
Date of publication: 20.11.2006


DROPS-Home | Fulltext Search | Imprint Published by LZI