References: [ Home | Author index | Key index | Search ]

Item(s) in original BibTeX format

@article{Bernstein1998b,
	author={D. Berstein},
	title={Detecting perfect powers in essentially linear time},
	abstract={This paper (1) gives complete details of an algorithm to compute approximate
		$k$th roots; (2) uses this in an algorithm that, given an integer $n>1$,
		either writes $n$ as a perfect power or proves that $n$ is not a perfect
		power; (3) proves, using Loxton's theorem on multiple linear forms in logarithms,
		that this perfect-power decomposition algorithm runs in time $(\log n)^{1+o(1)}$.},
	journal= mc,
	volume={67},
	year={1998},
	pages={1253--1283},
	number={223},
	mrnumber={98j:11121},
	note={Available from \url{http://cr.yp.to/papers.html}}
}