Accession Number:

AD0757678

Title:

The Computational Complexity of Algebraic Numbers,

Descriptive Note:

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1973-03-01

Pagination or Media Count:

9.0

Abstract:

The effort required to approximate an algebraic number should increase with its degree. In this paper the assertion is proven in a precise sense. The author shows that the optimal efficiency of approximation can be achieved only for algebraic numbers which have very low degrees in fact, degree one or degree two.

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE