( en | de | ru )

 

Disambiguation of "CUCKER, FELIPE"

Author of the publication

copydeleteadd this publication to your clipboard
ON THE MATHEMATICAL FOUNDATIONS OF LEARNING

, and . (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Felipe Zambaldi

Felipe Ortuño

Felipe Vieira

Felipe Huici

Felipe Herrera

 

Other publications of authors with the same name

Non Recursive Functions Have Transcendental Generating Series., and . RAIRO Theor. Informatics Appl., 23 (4): 445-448 (1989)Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem., and . STOC, page 503-512. ACM, (2010)The Legacy of Turing in Numerical Analysis.. SOFSEM, volume 7147 of Lecture Notes in Computer Science, page 1-13. Springer, (2012)ON THE MATHEMATICAL FOUNDATIONS OF LEARNING, and . (2001)On the Complexity of the Plantinga-Vegter Algorithm., , and . CoRR, (2020)On mixed and componentwise condition numbers for Moore-Penrose inverse and linear least squares problems., , and . Math. Comput., 76 (258): 947-963 (2007)Recent Advances in the Computation of the Homology of Semialgebraic Sets.. CiE, volume 11558 of Lecture Notes in Computer Science, page 1-12. Springer, (2019)Exotic Quantifiers, Complexity Classes, and Complete Problems., and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 207-218. Springer, (2007)On sparseness and Turing reducibility over the reals.. WoLLIC, volume 67 of Electronic Notes in Theoretical Computer Science, page 7-14. Elsevier, (2002)Recursiveness over the Complex Numbers is Time-Bounded., and . FSTTCS, volume 761 of Lecture Notes in Computer Science, page 260-267. Springer, (1993)