Works (1)

2010 journal article

Efficiently Certifying Non-Integer Powers

COMPUTATIONAL COMPLEXITY, 19(3), 355–366.

By: E. Kaltofen & M. Lavin

author keywords: Integer roots; integer powers; linear-time algorithm; bit complexity; Chebotarev density theorem
Source: Web Of Science
Added: August 6, 2018