The following pages link to Felipe Cucker (Q199198):
Displaying 50 items.
- Complexity and dimension (Q287068) (← links)
- A conditional, collision-avoiding, model for swarming (Q379777) (← links)
- Round-off estimates for second-order conic feasibility problems (Q447897) (← links)
- Condition length and complexity for the solution of polynomial systems (Q506608) (← links)
- A note on level-2 condition numbers (Q558006) (← links)
- Parallel time and quantifier prefixes (Q626666) (← links)
- A numerical algorithm for zero counting. III: Randomization and condition (Q651058) (← links)
- On a problem posed by Steve Smale (Q661924) (← links)
- Computing the homology of real projective sets (Q667646) (← links)
- (Q700761) (redirect page) (← links)
- Probabilistic analysis of condition numbers for linear programming (Q700762) (← links)
- The complexity of semilinear problems in succinct representation (Q862341) (← links)
- Smoothed analysis of complex conic condition numbers (Q864180) (← links)
- Nash functions over real spectra (Q923652) (← links)
- A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← links)
- Coverage processes on spheres and condition numbers for linear programming (Q964778) (← links)
- On strata of degenerate polyhedral cones. II: Relations between condition measures (Q964924) (← links)
- Adversarial smoothed analysis (Q983182) (← links)
- On the mathematics of emergence (Q1000339) (← links)
- Flocking with informed agents (Q1020628) (← links)
- Exotic quantifiers, complexity classes, and complete problems (Q1022429) (← links)
- On strata of degenerate polyhedral cones. I: Condition and distance to strata (Q1027575) (← links)
- Functions de Nash sur les variétés affines. (Nash functions on affine varieties) (Q1089398) (← links)
- (Q1177862) (redirect page) (← links)
- Effective Łojasiewicz inequalities in semialgebraic geometry (Q1177863) (← links)
- On a tolerance problem of parametric curves and surfaces (Q1195069) (← links)
- Test complexity of generic polynomials (Q1201154) (← links)
- \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\) (Q1201156) (← links)
- Two \(P\)-complete problems in the theory of the reals (Q1203649) (← links)
- A polynomial time algorithm for diophantine equations in one variable (Q1284218) (← links)
- Separation of complexity classes in Koiran's weak model (Q1338212) (← links)
- Generalized Knapsack problems and fixed degree separations (Q1351965) (← links)
- On the expected condition number of linear programming problems (Q1402168) (← links)
- Solving linear programs with finite precision. I: Condition numbers and random programs (Q1424293) (← links)
- Complexity lower bounds for approximation algebraic computation trees (Q1578509) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- A stable, polynomial-time algorithm for the eigenpair problem (Q1644000) (← links)
- Grid methods in computational real algebraic (and semialgebraic) geometry (Q1754715) (← links)
- Modeling language evolution (Q1767490) (← links)
- On sparseness, reducibilities, and complexity (Q1779309) (← links)
- Best choices for regularization parameters in learning theory: on the bias-variance problem. (Q1865826) (← links)
- Learning from rounded-off data. (Q1873753) (← links)
- The complexity to compute the Euler characteristic of complex varieties (Q1886973) (← links)
- Computing over the reals with addition and order: Higher complexity classes (Q1908895) (← links)
- Approximate zeros and condition numbers (Q1974565) (← links)
- Computing the homology of semialgebraic sets. II: General formulas (Q2052718) (← links)
- On the complexity of the Plantinga-Vegter algorithm (Q2172649) (← links)
- Recent advances in the computation of the homology of semialgebraic sets (Q2179343) (← links)
- A theorem on random polynomials and some consequences in average complexity (Q2277521) (← links)
- Nash functions and the structure sheaf (Q2277539) (← links)
