The following pages link to Felipe Cucker (Q199198):
Displaying 46 items.
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO (Q4344505) (← links)
- (Q4372496) (← links)
- (Q4417859) (← links)
- (Q4424619) (← links)
- Counting Complexity Classes for Numeric Computations I: Semilinear Sets (Q4441905) (← links)
- (Q4460831) (← links)
- On Flocks Under Switching Directed Interaction Topologies (Q4610485) (← links)
- Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time (Q4625671) (← links)
- Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time (Q4673356) (← links)
- (Q4673422) (← links)
- On digital nondeterminism (Q4717055) (← links)
- (Q4717931) (← links)
- (Q4717936) (← links)
- (Q4726379) (← links)
- Sur les anneaux de sections globales du faisceau structural sur le spectre reel (Q4729896) (← links)
- Non recursive functions have transcendental generating series (Q4732456) (← links)
- (Q4779151) (← links)
- (Q4789190) (← links)
- (Q4822033) (← links)
- Manifold Mirrors (Q4913543) (← links)
- On sparseness and Turing reducibility over the reals (Q4916198) (← links)
- Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH (Q4916232) (← links)
- (Q4925797) (← links)
- (Q4938618) (← links)
- Avoiding Collisions in Flocks (Q4978822) (← links)
- Logics which capture complexity classes over the reals (Q5055931) (← links)
- Functional norms, condition numbers and numerical algorithms in algebraic geometry (Q5056386) (← links)
- Plantinga-Vegter Algorithm takes Average Polynomial Time (Q5120482) (← links)
- Smoothed analysis of componentwise condition numbers for sparse matrices (Q5174179) (← links)
- A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (Q5177339) (← links)
- Algorithms and Computation (Q5191691) (← links)
- Emergent Behavior in Flocks (Q5282114) (← links)
- Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems (Q5317546) (← links)
- A General Collision-Avoiding Flocking Framework (Q5347708) (← links)
- Fast computation of zeros of polynomial systems with bounded degree under finite-precision (Q5401702) (← links)
- Exotic Quantifiers, Complexity Classes, and Complete Problems (Q5428810) (← links)
- (Q5465357) (← links)
- Fundamentals of Computation Theory (Q5492953) (← links)
- Unifying Condition Numbers for Linear Programming (Q5704143) (← links)
- Probabilistic analyses of condition numbers (Q5740078) (← links)
- On weak and weighted computations over the real closure of \(\mathbb{Q}\) (Q5941734) (← links)
- A new condition number for linear programming (Q5955567) (← links)
- Decision problems and round-off machines (Q5956789) (← links)
- Rigid continuation paths II. structured polynomial systems (Q6103341) (← links)
- Solving Linear Problems with Finite Precision III: Sharp Expectation Bounds (Q6225336) (← links)
- On local analysis (Q6319064) (← links)
