Arithmetic with real algebraic numbers is in NC

Bud Mishra, Paul Pedersen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We describe NC algorithms for doing exact arithmetic with real algebraic numbers in the signcoded representation introduced by Coste and Roy [CoR 1988]. We present polynomial sized circuits of depth O(log3 N) for the monadic operations -α, 1/α, as well as α + r, α · r, and sgn (α - r), where r is rational and α is real algebraic. We also present polynomial sized circuits of depth O(log7 N) for the dyadic operations α+β, α·β, and sgn(α-β), where α and β are both real algebraic. Our algorithms employ a strengthened form of the NC polynomial-consistency algorithm of Ben-Or, Kozen, and Reif [BKR 1986].

Original languageEnglish (US)
Title of host publicationISSAC '90 Proceedings of International Symposium on Symbolic and Algebraic Computation
PublisherPubl by ACM
Pages120-126
Number of pages7
ISBN (Print)0201548925, 9780201548921
DOIs
StatePublished - Jan 1 1990
EventISSAC '90 Proceedings of International Symposium on Symbolic and Algebraic Computation - Tokyo, Jpn
Duration: Aug 20 1990Aug 24 1990

Publication series

NameISSAC '90 Proceedings of International Symposium on Symbolic and Algebraic Computation

Other

OtherISSAC '90 Proceedings of International Symposium on Symbolic and Algebraic Computation
CityTokyo, Jpn
Period8/20/908/24/90

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Mishra, B., & Pedersen, P. (1990). Arithmetic with real algebraic numbers is in NC. In ISSAC '90 Proceedings of International Symposium on Symbolic and Algebraic Computation (pp. 120-126). (ISSAC '90 Proceedings of International Symposium on Symbolic and Algebraic Computation). Publ by ACM. https://doi.org/10.1145/96877.96909