The Computational Complexity of Algebraic Numbers,
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.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1973
- Accession Number
- AD0757678
Entities
People
- H. T. Kung
Organizations
- Carnegie Mellon University