Pages that link to "Item:Q3158534"

The following pages link to Complexity estimates depending on condition and round-off error (Q3158534):

Displaying 19 items.

• Faster \(p\)-adic feasibility for certain multivariate sparse polynomials (Q412210) (← links)
• Condition number based complexity estimate for solving polynomial systems (Q629539) (← links)
• Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) (Q633624) (← links)
• A numerical algorithm for zero counting. III: Randomization and condition (Q651058) (← links)
• Computing the homology of real projective sets (Q667646) (← links)
• A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← links)
• Condition number based complexity estimate for computing local extrema (Q1026449) (← links)
• Limits of theory sequences over algebraically closed fields and applications. (Q1421482) (← links)
• Complexity lower bounds for approximation algebraic computation trees (Q1578509) (← links)
• Real computations with fake numbers (Q1599196) (← links)
• Grid methods in computational real algebraic (and semialgebraic) geometry (Q1754715) (← links)
• Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
• Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
• Generalized polar varieties: geometry and algorithms (Q2387411) (← links)
• Positive root isolation for poly-powers by exclusion and differentiation (Q2409014) (← links)
• A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (Q5177339) (← links)
• (Q5389777) (← links)
• Fast computation of zeros of polynomial systems with bounded degree under finite-precision (Q5401702) (← links)
• Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing (Q6182782) (← links)