On solving univariate sparse polynomials in logarithmic time (Q1763426): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Kronecker / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jco.2004.03.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108397696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4110543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound for approximating the square root / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4293510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gröbner free alternative for polynomial system solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting real connected components of trinomial curve intersections and \(m\)-nomial hypersurfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sylvester-Habicht sequences and fast Cauchy index computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: High probability analysis of the condition number of sparse polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cost of computing integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On asymptotic estimates for arithmetic cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic acceleration of solving multivariate polynomial systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Solution of Multivariate Polynomial Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the complex roots problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the worst-case arithmetic complexity of approximating zeros of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving degenerate sparse polynomial systems faster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some speed-ups and speed limits for real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. V: Polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical problems for the next century / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5830638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the Havas, Majewski, Matthews LLL Hermite normal form algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining binary search and Newton's method to compute real roots for a class of real functions / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 17:23, 7 June 2024

scientific article
Language Label Description Also known as
English
On solving univariate sparse polynomials in logarithmic time
scientific article

    Statements

    On solving univariate sparse polynomials in logarithmic time (English)
    0 references
    0 references
    0 references
    22 February 2005
    0 references
    Sparse polynomial
    0 references
    Lacunary polynomial
    0 references
    Computational real algebraic geometry
    0 references
    Fewnomial
    0 references
    Speed up
    0 references
    Trinomial
    0 references
    Newton's method
    0 references
    Smale's 17th Problem
    0 references
    Real root counting
    0 references
    m-nomial
    0 references
    Alpha theory
    0 references
    Discriminant
    0 references
    Logarithmic
    0 references
    Complexity
    0 references
    Approximate root
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers