Linear Solving for Sign Determination
Daniel Perrucci
TL;DR
This paper introduces a quadratic complexity method for solving linear systems in sign determination problems, improving the complexity bounds specifically for univariate cases.
Contribution
It presents a novel quadratic complexity approach to linear systems in sign determination, enhancing efficiency for univariate problems.
Findings
Improved complexity bounds for univariate sign determination.
A specific quadratic complexity solving method.
Enhanced algorithmic efficiency in 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHandwritten Text Recognition Techniques