Pages that link to "Item:Q3577011"
From MaRDI portal
The following pages link to The probability that a slightly perturbed numerical analysis problem is difficult (Q3577011):
Displaying 18 items.
- A numerical algorithm for zero counting. III: Randomization and condition (Q651058) (← links)
- On a problem posed by Steve Smale (Q661924) (← links)
- Robust smoothed analysis of a condition number for linear programming (Q662310) (← links)
- From Steiner formulas for cones to concentration of intrinsic volumes (Q741611) (← links)
- Adversarial smoothed analysis (Q983182) (← links)
- Generalizations of the Kolmogorov-Barzdin embedding estimates (Q1759766) (← links)
- On the complexity of the Plantinga-Vegter algorithm (Q2172649) (← links)
- Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
- On local analysis (Q2303420) (← links)
- Probabilistic analysis of the Grassmann condition number (Q2340501) (← links)
- Average-case complexity without the black swans (Q2360669) (← links)
- Smooth analysis of the condition number and the least singular value (Q3160742) (← links)
- Smoothed Analysis of Local Search Algorithms (Q3449848) (← links)
- On the volume of tubular neighborhoods of real algebraic varieties (Q5179371) (← links)
- Probabilistic analyses of condition numbers (Q5740078) (← links)
- A formal proof of the expressiveness of deep learning (Q5915784) (← links)
- A formal proof of the expressiveness of deep learning (Q5919583) (← links)
- Hausdorff approximations and volume of tubes of singular algebraic sets (Q6093599) (← links)
