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
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 05:24, 1 February 2024

scientific article
In more languages
Configure
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)
    1 December 2017
    polynomial system
    homotopy continuation
    complexity analysis

    Identifiers