On solving univariate sparse polynomials in logarithmic time
From MaRDI portal
Recommendations
- Efficiently Computing Real Roots of Sparse Polynomials
- A near-optimal algorithm for computing real roots of sparse polynomials
- Randomization, sums of squares, near-circuits, and faster real root counting
- A root isolation algorithm for sparse univariate polynomials
- Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields
Cites work
- scientific article; zbMATH DE number 421660 (Why is no real title available?)
- scientific article; zbMATH DE number 421661 (Why is no real title available?)
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 49991 (Why is no real title available?)
- scientific article; zbMATH DE number 3533996 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 1023365 (Why is no real title available?)
- scientific article; zbMATH DE number 1503621 (Why is no real title available?)
- scientific article; zbMATH DE number 3992817 (Why is no real title available?)
- scientific article; zbMATH DE number 3091842 (Why is no real title available?)
- A Gröbner free alternative for polynomial system solving
- A tight bound for approximating the square root
- Accelerated Solution of Multivariate Polynomial Systems of Equations
- An efficient algorithm for the complex roots problem
- Asymptotic acceleration of solving multivariate polynomial systems of equations
- Combining binary search and Newton's method to compute real roots for a class of real functions
- Complexity of Bezout's theorem. V: Polynomial time
- Complexity of the Havas, Majewski, Matthews LLL Hermite normal form algorithm
- Counting real connected components of trinomial curve intersections and m-nomial hypersurfaces
- Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
- High probability analysis of the condition number of sparse polynomial systems
- Mathematical problems for the next century
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On asymptotic estimates for arithmetic cost functions
- On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Solving degenerate sparse polynomial systems faster
- Some speed-ups and speed limits for real algebraic geometry
- Sylvester-Habicht sequences and fast Cauchy index computation
- The cost of computing integers
Cited in
(12)- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\)
- Sparse shifts for univariate polynomials
- Randomized polynomial-time root counting in prime power rings
- Complexity of sparse polynomial solving 2: renormalization
- A root isolation algorithm for sparse univariate polynomials
- A near-optimal algorithm for computing real roots of sparse polynomials
- Randomization, sums of squares, near-circuits, and faster real root counting
- Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields
- Condition numbers for the cube. I: Univariate polynomials and hypersurfaces
- scientific article; zbMATH DE number 421660 (Why is no real title available?)
- Root separation for trinomials
- Sublinear root detection and new hardness results for sparse polynomials over finite fields
This page was built for publication: On solving univariate sparse polynomials in logarithmic time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763426)
