Abstract
Characterizing real algebraic numbers by a sign-sequence (according to Thom's lemma), using a variant of Ben Or Kozan and Reif algorithm for reducing the solving of systems of polynomial inequalities to the problem of counting real zeroes satisfying one polynomial inequality, and using a multivariate Sturm theory generalizing Hermite quadratic forms method for counting real zeroes, we prove that the computations on real algebraic numbers are in NC.
Original language | English (US) |
---|---|
Pages (from-to) | 79-98 |
Number of pages | 20 |
Journal | Applicable Algebra in Engineering, Communication and Computing |
Volume | 3 |
Issue number | 2 |
DOIs | |
State | Published - Jun 1992 |
Keywords
- NC complexity
- Parallel algebraic complexity
- Real algebraic numbers
- Sturm theory
- Systems of polynomial inequalities
- Thom's lemma
ASJC Scopus subject areas
- Algebra and Number Theory
- Applied Mathematics