Linear Solving for Sign Determination
Abstract
We give a specific method to solve with quadratic complexity the linear systems arising in known algorithms to deal with the sign determination problem. In particular, this enable us to improve the complexity bound for sign determination in the univariate case.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.