Works (1)

2010 journal article

Efficiently certifying non-integer powers

Computational Complexity, 19(3), 355–366.

By: E. Kaltofen & M. Lavin

Source: NC State University Libraries
Added: August 6, 2018