Searching for authors named Felipe Cucker – sorted by Relevance.
-
Nash Trees and Nash Complexity
- Nash Trees and Nash Complexity 1 Felipe Cucker 23 Universitat Pompeu Fabra Email: cucker
- Add To MetaCart
-
On the power of real Turing machines over binary inputs
- On the power of real Turing machines over binary inputs Felipe Cucker Universitat Pompeu Fabra
- Cited by 17 (2 self) – Add To MetaCart
-
Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets
- , Illinois, USA. Copyright 2004 ACM 1-58113-852-0/04/0006 ...$5.00. Felipe Cucker ‡ Department of Mathematics
- Cited by 8 (4 self) – Add To MetaCart
-
Logics Which Capture Complexity Classes Over the Reals
- Logics which capture complexity classes over the reals * Felipe Cucker Department of Mathematics
- Cited by 6 (3 self) – Add To MetaCart
-
Complexity Lower Bounds for Approximation Algebraic Computation Trees
- Complexity lower bounds for approximation algebraic computation trees Felipe Cucker Department
- Cited by 3 (0 self) – Add To MetaCart
-
Counting complexity classes over the reals I: The additive case
- ⋆ ⋆ ⋆ and Felipe Cucker 1 Faculty of Computer Science, Electrical Engineering, and Mathematics Paderborn University
- Cited by 1 (1 self) – Add To MetaCart
-
On the mathematics of emergence
- The Mathematics of Emergence ∗ Felipe Cucker Department of Mathematics City University of Hong
- Cited by 3 (1 self) – Add To MetaCart
-
On the mathematical foundations of learning
- CUCKER AND STEVE SMALE Introduction The problem of learning is arguably at the very core of the problem
- Cited by 120 (3 self) – Add To MetaCart
-
On the Expected Condition Number of Linear Programming Problems
- On the Expected Condition Number of Linear Programming Problems Felipe Cucker Department
- Cited by 2 (1 self) – Add To MetaCart
-
A Polynomial Time Algorithm for Diophantine Equations in One Variable
- A Polynomial Time Algorithm for Diophantine Equations in One Variable Felipe Cucker Department
- Add To MetaCart

