Home

V.__Arvind


On pseudorandomness and resource-bounded measure

Solvable black-box group problems are low for PP. Theoretical Computer Science

Upper bounds on the complexity of sparse and tally descriptions