License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.06111.5
URN: urn:nbn:de:0030-drops-6171
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2006/617/
Go to the corresponding Portal

Shparlinski, Igor E.

Bounds on the Fourier Coefficients of the Weighted Sum Function

pdf-format:
06111.ShparlinskiIgor.Paper.617.pdf (0.3 MB)

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:DagSemProc.06111.5,
  author =	{Shparlinski, Igor E.},
  title =	{{Bounds on the Fourier Coefficients of the Weighted Sum Function}},
  booktitle =	{Complexity of Boolean Functions},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6111},
  editor =	{Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2006/617},
  URN =		{urn:nbn:de:0030-drops-6171},
  doi =		{10.4230/DagSemProc.06111.5},
  annote =	{Keywords: Fourier coefficients, congruences, average sensitivity, decision tree}
}

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

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI