Complexity of Bezout's theorem. VII: Distance estimates in the condition metric (Q1022431): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q937275
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10208-007-9018-5 / rank
Normal rank
 
Property / author
 
Property / author: Carlos Beltran / 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.1007/s10208-007-9018-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024090003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Massively parallel computations on many-variable polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3421275 / 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: Solving a Polynomial Equation: Some History and Recent Progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279734 / 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. III: Condition number and packing / 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: Complexity of Bezout’s Theorem IV: Probability of Success; Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501787 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10208-007-9018-5 / rank
 
Normal rank

Latest revision as of 13:24, 10 December 2024

scientific article
Language Label Description Also known as
English
Complexity of Bezout's theorem. VII: Distance estimates in the condition metric
scientific article

    Statements

    Identifiers

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