A numerical algorithm for zero counting. III: Randomization and condition (Q651058): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3101405261 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57733099 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1007.1597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level Sets and Extrema of Random Processes and Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Smale's 17th problem: a probabilistic positive solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. VII: Distance estimates in the condition metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the probability distribution of data at points in real complete intersection varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The probability that a slightly perturbed numerical analysis problem is difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity estimates depending on condition and round-off error / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical algorithm for zero counting. I: Complexity and accuracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On condition numbers and the distance to the nearest ill-posed problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some characterizations and properties of the ``distance to the ill-posedness'' and the condition measure of a conic linear system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ill-Conditioned Matrices Are Componentwise Near to Singularity / 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. 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: Note on matrices with a very ill-conditioned eigenproblem / rank
 
Normal rank

Latest revision as of 18:09, 4 July 2024

scientific article
Language Label Description Also known as
English
A numerical algorithm for zero counting. III: Randomization and condition
scientific article

    Statements

    A numerical algorithm for zero counting. III: Randomization and condition (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    zero counting
    0 references
    finite precision
    0 references
    condition numbers
    0 references
    average-case analysis
    0 references
    Rice formula
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references