Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > ASYMPTOTIC EXPANSIONS:
Reports tagged with Asymptotic expansions:
TR14-125 | 9th October 2014
Anindya De

#### Beyond the Central Limit Theorem: asymptotic expansions and pseudorandomness for combinatorial sums

In this paper, we construct pseudorandom generators for the class of \emph{combinatorial sums}, a class of functions first studied by \cite{GMRZ13}
and defined as follows: A function $f: [m]^n \rightarrow \{0,1\}$ is said to be a combinatorial sum if there exists functions $f_1, \ldots, f_n: [m] \rightarrow \{0,1\}$ such that
more >>>

ISSN 1433-8092 | Imprint