A Condition Number for Multifold Conic Systems

A General Collision-Avoiding Flocking Framework

A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine

A Randomized Homotopy for the Hermitian Eigenpair Problem

A conditional, collision-avoiding, model for swarming

A note on level-2 condition numbers

A note on parallel and alternating time

A numerical algorithm for zero counting, I: Complexity and accuracy

A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis

A numerical algorithm for zero counting. III: Randomization and condition

Adversarial smoothed analysis

An Alternate Proof of the Continuity of the Roots of a Polynomial

Approximate Zeros and Condition Numbers

Avoiding Collisions in Flocks

scientific article published in 2010

Best Choices for Regularization Parameters in Learning Theory: On the Bias—Variance Problem

article

Complexity Lower Bounds for Approximation Algebraic Computation Trees

scholarly article by Felipe Cucker & Dima Grigoriev published December 1999 in Journal of Complexity

Complexity and Real Computation

Complexity and Real Computation

1998 non-fiction book

Componentwise Condition Numbers of Random Sparse Matrices

Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time

scientific article published in 2019

Condition

Condition Length and Complexity for the Solution of Polynomial Systems

Counting Complexity Classes for Numeric Computations I: Semilinear Sets

Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets

Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets

scholarly article by Peter Bürgisser & Felipe Cucker published April 2006 in Journal of Complexity

Coverage processes on spheres and condition numbers for linear programming

Emergent Behavior in Flocks

scientific article published in 2007

Exotic Quantifiers, Complexity Classes, and Complete Problems

article by Peter Bürgisser et al published 25 September 2007 in Foundations of Computational Mathematics

Fast computation of zeros of polynomial systems with bounded degree under finite-precision

Flocking in noisy environments

scientific article published in 2008

Flocking with informed agents

scientific article published in 2008

Fonctions de Nash sur les vari�t�s affines

General formulas for the smoothed analysis of condition numbers

article

Implicit complexity over an arbitrary structure: Quantifier alternations

Learning from rounded-off data

Linear Programming and Condition Numbers under the Real Number Computation Model

Logics which capture complexity classes over the reals

Manifold Mirrors

Mixed and componentwise condition numbers for rectangular structured matrices

Modeling Language Evolution

Nash functions over real spectra

On a problem posed by Steve Smale

scientific article (publication date: November 2011)

On sparseness and Turing reducibility over the reals

On sparseness, reducibilities, and complexity

On strata of degenerate polyhedral cones I: Condition and distance to strata

On strata of degenerate polyhedral cones, II: Relations between condition measures

On the Average Condition of Random Linear Programs

On the Complexity of the Plantinga–Vegter Algorithm

scientific article published in 2022

On the Expected Condition Number of Linear Programming Problems

On the mathematical foundations of learning

On the mathematics of emergence

scientific article published in 2007

On weak and weighted computations over the real closure of Q

PR ≠ NCR

Parallel Time and Quantifier Prefixes

Real Computations with Fake Numbers

article by Felipe Cucker published March 2002 in Journal of Complexity

Round-off estimates for second-order conic feasibility problems

article

Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH

Smoothed Analysis of Moore–Penrose Inversion

Smoothed analysis of complex conic condition numbers

Solving linear programs with finite precision: I. Condition numbers and random programs

Solving linear programs with finite precision: II. Algorithms

scholarly article by Dennis Cheung & Felipe Cucker published June 2006 in Journal of Complexity

Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem

Solving second-order conic systems with variable precision

Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems

article

The Legacy of Turing in Numerical Analysis

The complexity of semilinear problems in succinct representation

The complexity to compute the Euler characteristic of complex varieties

article

The probability that a slightly perturbed numerical analysis problem is difficult

Unifying Condition Numbers for Linear Programming