Sciweavers

50 search results - page 1 / 10
» Bounds on the Fourier Coefficients of the Weighted Sum Funct...
Sort
View
DAGSTUHL
2006
13 years 6 months ago
Bounds on the Fourier Coefficients of the Weighted Sum Function
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...
Igor Shparlinski
COLT
2008
Springer
13 years 6 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
APPML
2006
81views more  APPML 2006»
13 years 4 months ago
On the nonlinearity of linear recurrence sequences
We obtain an upper bound on a new type of exponential sums with linear recurrence sequences. We apply this bound to estimate the Fourier coefficients, and thus the nonlinearity, o...
Igor Shparlinski, Arne Winterhof
AI
2010
Springer
13 years 5 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
AAECC
1993
Springer
170views Algorithms» more  AAECC 1993»
13 years 9 months ago
Exponential Sums as Discrete Fourier Transform with Invariant Phase Functions
We give estimates for exponential sums over finite fields in several variables. We study the case where the phase is either quadratic or more generally invariant under the action ...
Gilles Lachaud