On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials (Q3831940): Difference between revisions

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

Latest revision as of 19:47, 19 March 2024

scientific article
Language Label Description Also known as
English
On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
scientific article

    Statements

    On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials (English)
    0 references
    0 references
    1989
    0 references
    worst-case arithmetic complexity
    0 references
    zeros of systems of polynomials
    0 references
    upper and lower bounds
    0 references
    algorithm
    0 references

    Identifiers

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