A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time (Q1683739): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10208-016-9319-7 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3099047857 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1507.05485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's Theorem I: Geometric Aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout’s Theorem IV: Probability of Success; Extensions / 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: 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: Fast linear homotopy to find approximate zeros of polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem posed by Steve Smale / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smale’s 17th problem: Average polynomial time to compute affine and projective solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of zeros of polynomial systems with bounded degree under finite-precision / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for generating uniformly distributed points on \(N\)-dimensional spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stable, polynomial-time algorithm for the eigenpair problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized homotopy for the Hermitian eigenpair problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condition length and complexity for the solution of polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuation method to solve polynomial systems and its complexity / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10208-016-9319-7 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:16, 11 December 2024

scientific article
Language Label Description Also known as
English
A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
scientific article

    Statements

    A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time (English)
    0 references
    0 references
    1 December 2017
    0 references
    polynomial system
    0 references
    homotopy continuation
    0 references
    complexity analysis
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references