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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W3099047857 / rank
 
Normal rank

Revision as of 01:59, 20 March 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