Linear solving for sign determination
From MaRDI portal
Publication:638542
DOI10.1016/j.tcs.2011.05.006zbMath1221.68301arXiv0911.5707MaRDI QIDQ638542
Publication date: 12 September 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.5707
68W30: Symbolic computation and algebraic computation
14Q20: Effectivity, complexity and computational aspects of algebraic geometry
Related Items
Zero counting for a class of univariate Pfaffian functions, A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set, Zero-nonzero and real-nonreal sign determination
Cites Work
- Complexity of computation on real algebraic numbers
- Matrix multiplication via arithmetic progressions
- On sign conditions over real multivariate polynomials
- The complexity of elementary algebra and geometry
- Improved Algorithms for Sign Determination and Existential Quantifier Elimination
- Algorithms in real algebraic geometry