Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Satyadev Nandakumar:

TR14-057 | 17th April 2014
Manindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar

Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness

Revisions: 3

In this paper, we propose a quantification of distributions on a set
of strings, in terms of how close to pseudorandom the distribution
is. The quantification is an adaptation of the theory of dimension of
sets of infinite sequences first introduced by Lutz
We show that this definition ... more >>>

TR06-038 | 10th February 2006
David Doty, Jack H. Lutz, Satyadev Nandakumar

Finite-State Dimension and Real Arithmetic

We use entropy rates and Schur concavity to prove that, for every integer k >= 2, every nonzero rational number q, and every real number alpha, the base-k expansions of alpha, q+alpha, and q*alpha all have the same finite-state dimension and the same finite-state strong dimension. This extends, and gives ... more >>>

ISSN 1433-8092 | Imprint