Linear Solving for Sign Determination
classification
🧮 math.AG
cs.SC
keywords
determinationsigncomplexitylinearalgorithmsarisingboundcase
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.