| 2008 |
|---|
| 61 | EE | Felipe Cucker,
Teresa Krick,
Gregorio Malajovich,
Mario Wschebor:
A numerical algorithm for zero counting, I: Complexity and accuracy.
J. Complexity 24(5-6): 582-605 (2008) |
| 2007 |
|---|
| 60 | EE | Peter Bürgisser,
Felipe Cucker:
Exotic Quantifiers, Complexity Classes, and Complete Problems.
ICALP 2007: 207-218 |
| 59 | EE | Felipe Cucker,
Teresa Krick,
Gregorio Malajovich,
Mario Wschebor:
A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy
CoRR abs/0710.4508: (2007) |
| 58 | EE | Felipe Cucker,
Irénée Briquel:
A note on parallel and alternating time.
J. Complexity 23(4-6): 594-602 (2007) |
| 2006 |
|---|
| 57 | EE | Peter Bürgisser,
Felipe Cucker,
Paulin Jacobé de Naurois:
The complexity of semilinear problems in succinct representation.
Computational Complexity 15(3): 197-235 (2006) |
| 56 | EE | Olivier Bournez,
Felipe Cucker,
Paulin Jacobé de Naurois,
Jean-Yves Marion:
Implicit complexity over an arbitrary structure: Quantifier alternations.
Inf. Comput. 204(2): 210-230 (2006) |
| 55 | EE | Peter Bürgisser,
Felipe Cucker:
Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets.
J. Complexity 22(2): 147-191 (2006) |
| 54 | EE | Dennis Cheung,
Felipe Cucker:
Solving linear programs with finite precision: II. Algorithms.
J. Complexity 22(3): 305-335 (2006) |
| 2005 |
|---|
| 53 | EE | Peter Bürgisser,
Felipe Cucker,
Paulin Jacobé de Naurois:
The Complexity of Semilinear Problems in Succinct Representation.
FCT 2005: 479-490 |
| 52 | EE | Felipe Cucker:
On sparseness, reducibilities, and complexity.
Ann. Pure Appl. Logic 134(1): 53-61 (2005) |
| 51 | EE | Peter Bürgisser,
Felipe Cucker:
Exotic quantifiers, complexity classes, and complete problems
Electronic Colloquium on Computational Complexity (ECCC)(138): (2005) |
| 50 | EE | Lenore Blum,
Felipe Cucker,
Tomaso Poggio,
James Renegar,
Michael Shub:
Foreword.
Foundations of Computational Mathematics 5(4): 349 (2005) |
| 49 | EE | Peter Bürgisser,
Felipe Cucker,
Martin Lotz:
Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets.
Foundations of Computational Mathematics 5(4): 351-387 (2005) |
| 48 | EE | Dennis Cheung,
Felipe Cucker:
A note on level-2 condition numbers.
J. Complexity 21(3): 314-319 (2005) |
| 47 | EE | Olivier Bournez,
Felipe Cucker,
Paulin Jacobé de Naurois,
Jean-Yves Marion:
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time.
J. Log. Comput. 15(1): 41-58 (2005) |
| 2004 |
|---|
| 46 | | Olivier Bournez,
Felipe Cucker,
Paulin Jacobé de Naurois,
Jean-Yves Marion:
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures.
IFIP TCS 2004: 409-422 |
| 45 | EE | Peter Bürgisser,
Felipe Cucker:
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets.
STOC 2004: 475-485 |
| 44 | EE | Felipe Cucker,
Steve Smale,
Ding-Xuan Zhou:
Modeling Language Evolution.
Foundations of Computational Mathematics 4(3): 315-343 (2004) |
| 43 | EE | Dennis Cheung,
Felipe Cucker:
Solving linear programs with finite precision: I. Condition numbers and random programs.
Math. Program. 99(1): 175-196 (2004) |
| 2003 |
|---|
| 42 | EE | Olivier Bournez,
Felipe Cucker,
Paulin Jacobé de Naurois,
Jean-Yves Marion:
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time.
FoSSaCS 2003: 185-199 |
| 41 | EE | Peter Bürgisser,
Felipe Cucker:
Counting Complexity Classes over the Reals I: The Additive Case.
ISAAC 2003: 625-634 |
| 40 | EE | Peter Bürgisser,
Felipe Cucker:
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets
CoRR cs.CC/0312007: (2003) |
| 39 | EE | Olivier Bournez,
Felipe Cucker,
Paulin Jacobé de Naurois,
Jean-Yves Marion:
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH.
Electr. Notes Theor. Comput. Sci. 90(1): (2003) |
| 38 | EE | Dennis Cheung,
Felipe Cucker:
Learning from rounded-off data.
Inf. Comput. 182(1): 1-13 (2003) |
| 37 | EE | Dennis Cheung,
Felipe Cucker,
Javier Peña:
Unifying Condition Numbers for Linear Programming.
Math. Oper. Res. 28(4): 609-624 (2003) |
| 2002 |
|---|
| 36 | EE | Felipe Cucker:
On sparseness and Turing reducibility over the reals.
Electr. Notes Theor. Comput. Sci. 67: (2002) |
| 35 | EE | Felipe Cucker,
Steve Smale:
Best Choices for Regularization Parameters in Learning Theory: On the Bias-Variance Problem.
Foundations of Computational Mathematics 2(4): 413-428 (2002) |
| 34 | EE | Felipe Cucker:
Real Computations with Fake Numbers.
J. Complexity 18(1): 104-134 (2002) |
| 2001 |
|---|
| 33 | EE | Felipe Cucker,
Dima Grigoriev:
There Are No Sparse NPW-Hard Sets.
MFCS 2001: 285-291 |
| 32 | EE | Felipe Cucker,
Dima Grigoriev:
There are No Sparse NPw-Hard Sets.
SIAM J. Comput. 31(1): 193-198 (2001) |
| 31 | EE | Felipe Cucker:
On weak and weighted computations over the real closure of Q.
Theor. Comput. Sci. 255(1-2): 593-600 (2001) |
| 2000 |
|---|
| 30 | EE | Felipe Cucker:
Solving polynomial systems: a complexity theory viewpoint.
ISSAC 2000 |
| 29 | EE | Felipe Cucker,
Thomas Lickteig:
Preface.
J. Complexity 16(1): 1 (2000) |
| 1999 |
|---|
| 28 | EE | Felipe Cucker:
Real Computations with Fake Numbers.
ICALP 1999: 55-73 |
| 27 | EE | Felipe Cucker,
Steve Smale:
Complexity Estimates Depending on Condition and Round-Off Error.
J. ACM 46(1): 113-184 (1999) |
| 26 | EE | Felipe Cucker:
Approximate Zeros and Condition Numbers.
J. Complexity 15(2): 214-226 (1999) |
| 25 | EE | Felipe Cucker,
Dima Grigoriev:
Complexity Lower Bounds for Approximation Algebraic Computation Trees.
J. Complexity 15(4): 499-512 (1999) |
| 24 | | Felipe Cucker,
Pascal Koiran,
Steve Smale:
A Polynomial Time Algorithm for Diophantine Equations in One Variable.
J. Symb. Comput. 27(1): 21-29 (1999) |
| 23 | | Felipe Cucker,
Klaus Meer:
Logics Which Capture Complexity Classes Over The Reals.
J. Symb. Log. 64(1): 363-390 (1999) |
| 1998 |
|---|
| 22 | EE | Felipe Cucker,
Steve Smale:
Complexity Estimates Depending on Condition and Round-Off Error.
ESA 1998: 115-126 |
| 1997 |
|---|
| 21 | | Felipe Cucker,
Klaus Meer:
Logics Which Capture Complexity Classes over the Reals.
FCT 1997: 157-167 |
| 20 | EE | Felipe Cucker,
Pascal Koiran,
Martín Matamala:
Complexity and Dimension.
Inf. Process. Lett. 62(4): 209-212 (1997) |
| 19 | | Felipe Cucker:
Machines Over the Reals and Non Uniformity.
Math. Log. Q. 43: 143-157 (1997) |
| 18 | | Felipe Cucker,
Dima Grigoriev:
On the Power of Real Turing Machines Over Binary Inputs.
SIAM J. Comput. 26(1): 243-254 (1997) |
| 1996 |
|---|
| 17 | EE | Felipe Cucker,
Michael Shub:
EDITOR'S FOREWORD.
J. Complexity 12(4): 255-256 (1996) |
| 16 | | Felipe Cucker,
Martín Matamala:
On Digital Nondeterminism.
Mathematical Systems Theory 29(6): 635-647 (1996) |
| 15 | EE | Felipe Cucker,
Mike Shub:
Generalized Knapsack Problems and Fixed Degree Separations.
Theor. Comput. Sci. 161(1&2): 301-306 (1996) |
| 1995 |
|---|
| 14 | EE | Felipe Cucker,
Marek Karpinski,
Pascal Koiran,
Thomas Lickteig,
Kai Werther:
On real Turing machines that toss coins.
STOC 1995: 335-342 |
| 13 | EE | Felipe Cucker,
Pascal Koiran:
Computing over the Reals with Addition and Order: Higher Complexity Classes.
J. Complexity 11(3): 358-376 (1995) |
| 1994 |
|---|
| 12 | | Felipe Cucker,
Mike Shub,
Steve Smale:
Separation of Complexity Classes in Koiran's Weak Model.
Theor. Comput. Sci. 133(1): 3-14 (1994) |
| 1993 |
|---|
| 11 | | Felipe Cucker,
Francesc Rosselló:
Recursiveness over the Complex Numbers is Time-Bounded.
FSTTCS 1993: 260-267 |
| 10 | | Felipe Cucker:
On the Complexity of Quantifier Elimination: the Structural Approach.
Comput. J. 36(5): 400-408 (1993) |
| 1992 |
|---|
| 9 | | Felipe Cucker,
Francesc Rosselló:
On the Complexity of Some Problems for the Blum, Shub & Smale Model.
LATIN 1992: 117-129 |
| 8 | | Felipe Cucker,
Hervé Lanneau,
Bud Mishra,
Paul Pedersen,
Marie-Françoise Roy:
NC Algorithms for Real Algebraic Numbers.
Appl. Algebra Eng. Commun. Comput. 3: 79-98 (1992) |
| 7 | EE | Felipe Cucker:
PR != NCR.
J. Complexity 8(3): 230-238 (1992) |
| 6 | EE | Felipe Cucker,
A. Torrecillas:
Two P-complete problems in the theory of the reals.
J. Complexity 8(4): 454-466 (1992) |
| 5 | | Felipe Cucker:
The Arithmetical Hierarchy over the Reals.
J. Log. Comput. 2(3): 375-395 (1992) |
| 1991 |
|---|
| 4 | | Felipe Cucker,
A. Torrecillas:
Two P-Complete Problems in the Theory of the Reals.
ICALP 1991: 556-565 |
| 1990 |
|---|
| 3 | | Felipe Cucker,
Marie-Françoise Roy:
Kac's Theorem on the Number of Real Roots and its Consequences in Average Complexity.
J. Symb. Comput. 10(5): 405-410 (1990) |
| 1989 |
|---|
| 2 | | Felipe Cucker,
Joaquim Gabarró:
Non Recursive Functions Have Transcendental Generating Series.
ITA 23(4): 445-448 (1989) |
| 1987 |
|---|
| 1 | | Felipe Cucker,
Luis Miguel Pardo,
Mario Raimondo,
Tomás Recio,
Marie-Françoise Roy:
On the Computation of the Local and Global Analytic Branches of a Real Algebraic Curve.
AAECC 1987: 161-181 |
