COMPUTING THE RAMANUJAN TAU FUNCTION DENIS XAVIER CHARLES We show that the Ramanujan Tau function τ(n) can be computed by a randomized algorithm 1 that runs in time O(n 2 ) for every > 0 under GRH. The same method - Ramanujan tau function - Document - PDFSEARCH.IO

First Page	Meta Content
	COMPUTING THE RAMANUJAN TAU FUNCTION DENIS XAVIER CHARLES We show that the Ramanujan Tau function τ(n) can be computed by a randomized algorithm 1 that runs in time O(n 2 + ) for every > 0 under GRH. The same method Add to Reading List Document Date: 2009-07-16 15:38:35 Open Document File Size: 175,55 KB Share Result on Facebook Company Cambridge University Press / / Country Jordan / / / Facility University of Wisconsin-Madison / / IndustryTerm exponential time algorithm / sub-exponential time algorithms / deterministic algorithm / computing / / Organization Cambridge University / National Science Foundation / Department of Computer Science / University of Wisconsin / / Person Eric Bach / Ken Ono / Victor Miller / DENIS XAVIER CHARLES / / Position author / professor / / ProvinceOrState Wisconsin / / Technology deterministic algorithm / sub-exponential time algorithms / exponential time algorithm / randomized algorithm / deterministic 3 algorithm / deterministic 1 algorithms / / SocialTag Analytic number theory Arithmetic function Elliptic functions Randomized algorithm Expectation–maximization algorithm Euclidean algorithm Mathematical analysis Mathematics Modular forms

COMPUTING THE RAMANUJAN TAU FUNCTION DENIS XAVIER CHARLES We show that the Ramanujan Tau function τ(n) can be computed by a randomized algorithm 1 that runs in time O(n 2 + ) for every  > 0 under GRH. The same method Add to Reading List