AAAAAA
Results:
1-12
|
Results: 12
Authors:
Cucker, F
Smale, S
Citation: F. Cucker et S. Smale, On the mathematical foundations of learning, B AM MATH S, 39(1), 2002, pp. 1-49
Authors:
Cucker, F
Dedieu, JP
Citation: F. Cucker et Jp. Dedieu, Decision problems and round-off machines, THEOR C SYS, 34(5), 2001, pp. 433-452
Authors:
Cucker, F
Citation: F. Cucker, On weak and weighted computations over the real closure of Q, THEOR COMP, 255(1-2), 2001, pp. 593-600
Authors:
Cucker, F
Grigoriev, D
Citation: F. Cucker et D. Grigoriev, There are no sparse NPW-hard sets, SIAM J COMP, 31(1), 2001, pp. 193-198
Authors:
Cheung, D
Cucker, F
Citation: D. Cheung et F. Cucker, A new condition number for linear programming, MATH PROGR, 91(1), 2001, pp. 163-174
Authors:
Cucker, F
Lickteig, T
Citation: F. Cucker et T. Lickteig, Preface, J COMPLEX, 16(1), 2000, pp. 1-1
Authors:
Blum, L
Cucker, F
Citation: L. Blum et F. Cucker, Selected papers in honor of Manuel Blum - Foreword, THEOR COMP, 235(1), 2000, pp. 1-2
Authors:
Cucker, F
Smale, S
Citation: F. Cucker et S. Smale, Complexity estimates depending on condition and round-off error, J ACM, 46(1), 1999, pp. 113-184
Authors:
Cucker, F
Grigoriev, D
Citation: F. Cucker et D. Grigoriev, Complexity lower bounds for approximation algebraic computation trees, J COMPLEX, 15(4), 1999, pp. 499-512
Authors:
Cucker, F
Citation: F. Cucker, Approximate zeros and condition numbers, J COMPLEX, 15(2), 1999, pp. 214-226
Authors:
Cucker, F
Koiran, P
Smale, S
Citation: F. Cucker et al., A polynomial time algorithm for diophantine equations in one variable, J SYMB COMP, 27(1), 1999, pp. 21-29
Authors:
Cucker, F
Meer, K
Citation: F. Cucker et K. Meer, Logics which capture complexity classes over the reals, J SYMB LOG, 64(1), 1999, pp. 363-390
Risultati:
1-12
|