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...
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...
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...
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 ...
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 ...