Complexity estimates depending on condition and round-off error
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1305086
- On the complexity of computing error bounds
- An estimate for round-off error in the elimination problem
- Complexity of fixed point computation
- scientific article; zbMATH DE number 3420721
- scientific article; zbMATH DE number 2221549
- Complexity of approximation problems
- scientific article; zbMATH DE number 1789925
- The Complexity of Computing the Size of an Interval
Cited in
(26)- Real computations with fake numbers
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\)
- Fast computation of zeros of polynomial systems with bounded degree under finite-precision
- Notes on the classification of numerical algorithms with respect to their stability to roundoff errors
- scientific article; zbMATH DE number 3994936 (Why is no real title available?)
- Limits of theory sequences over algebraically closed fields and applications.
- A numerical algorithm for zero counting. III: Randomization and condition
- Grid methods in computational real algebraic (and semialgebraic) geometry
- A theory of complexity, condition, and roundoff
- A numerical algorithm for zero counting. I: Complexity and accuracy
- Root Neighborhoods of a Polynomial
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing
- Generalized polar varieties and an efficient real elimination.
- On the computation of the homology of semialgebraic sets
- Generalized polar varieties: geometry and algorithms
- Round-off estimates for second-order conic feasibility problems
- Instability in deep learning -- when algorithms cannot compute uncertainty quantifications for neural networks
- The mathematics of adversarial attacks in AI -- why deep learning is unstable despite the existence of stable neural networks
- Computing the homology of semialgebraic sets. I: Lax formulas
- Condition number based complexity estimate for computing local extrema
- Faster p-adic feasibility for certain multivariate sparse polynomials
- Complexity lower bounds for approximation algebraic computation trees
- Positive root isolation for poly-powers by exclusion and differentiation
- Condition number based complexity estimate for solving polynomial systems
- Computing the homology of real projective sets
- Some aspects of studying an optimization or decision problem in different computational models
This page was built for publication: Complexity estimates depending on condition and round-off error
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3158534)
