The following pages link to Felipe Cucker (Q199198):
Displaying 50 items.
- Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
- On local analysis (Q2303420) (← links)
- Solving second-order conic systems with variable precision (Q2340331) (← links)
- A randomized homotopy for the Hermitian eigenpair problem (Q2340509) (← links)
- On the condition of the zeros of characteristic polynomials (Q2402421) (← links)
- A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis (Q2431382) (← links)
- Mixed and componentwise condition numbers for rectangular structured matrices (Q2462233) (← links)
- A note on parallel and alternating time (Q2465291) (← links)
- Flocking in noisy environments (Q2481499) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- Implicit complexity over an arbitrary structure: Quantifier alternations (Q2490113) (← links)
- Solving linear programs with finite precision. II: Algorithms (Q2496177) (← links)
- General formulas for the smoothed analysis of condition numbers (Q2499745) (← links)
- Counting complexity classes for numeric computations. III: Complex projective sets (Q2505650) (← links)
- On the mathematical foundations of learning (Q2761194) (← links)
- Three lectures on real computation (Q2776268) (← links)
- A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine (Q2784423) (← links)
- There are no sparse NP\(_{w}\)-hard sets (Q2784447) (← links)
- Condition (Q2837795) (← links)
- On the average condition of random linear programs (Q2848174) (← links)
- Solving polynomial equations in smoothed polynomial time and a near solution to Smale's 17th problem (Q2875178) (← links)
- The Legacy of Turing in Numerical Analysis (Q2891357) (← links)
- On flocks influenced by closest neighbors (Q2958490) (← links)
- Smoothed Analysis of Moore–Penrose Inversion (Q3079770) (← links)
- On the Complexity of Quantifier Elimination: the Structural Approach (Q3140550) (← links)
- Complexity estimates depending on condition and round-off error (Q3158534) (← links)
- (Q3209245) (← links)
- Smale 17th Problem: Advances and Open Directions (Q3380357) (← links)
- Smoothed analysis of some condition numbers (Q3412454) (← links)
- On mixed and componentwise condition numbers for Moore–Penrose inverse and linear least squares problems (Q3426030) (← links)
- Learning Theory (Q3426914) (← links)
- An Alternate Proof of the Continuity of the Roots of a Polynomial (Q3490227) (← links)
- Componentwise Condition Numbers of Random Sparse Matrices (Q3561180) (← links)
- The probability that a slightly perturbed numerical analysis problem is difficult (Q3577011) (← links)
- Counting complexity classes for numeric computations II (Q3580991) (← links)
- A Condition Number for Multifold Conic Systems (Q3608982) (← links)
- ON THE CRITICAL EXPONENT FOR FLOCKS UNDER HIERARCHICAL LEADERSHIP (Q3638792) (← links)
- (Q3743407) (← links)
- (Q3818424) (← links)
- On algorithms for real algebraic plane curves (Q3973331) (← links)
- The Arithmetical Hierarchy Over the Reals (Q4018169) (← links)
- TIME BOUNDED COMPUTATIONS OVER THE REALS (Q4029500) (← links)
- (Q4036593) (← links)
- (Q4228729) (← links)
- (Q4234080) (← links)
- (Q4252028) (← links)
- Logics which capture complexity classes over the reals (Q4254641) (← links)
- (Q4268461) (← links)
- Machines Over the Reals and Non-Uniformity (Q4336697) (← links)
- On the Power of Real Turing Machines over Binary Inputs (Q4337443) (← links)
