( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Time Bounded Computations over the Reals.

, , и . Int. J. Algebra Comput., 2 (4): 395-408 (1992)

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.

Felipe Zambaldi

Felipe Ortuño

Felipe Vieira

Felipe Huici

Felipe Herrera

 

Другие публикации лиц с тем же именем

On the Complexity of the Plantinga-Vegter Algorithm., , и . CoRR, (2020)Non Recursive Functions Have Transcendental Generating Series., и . 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., и . STOC, стр. 503-512. ACM, (2010)The Legacy of Turing in Numerical Analysis.. SOFSEM, том 7147 из Lecture Notes in Computer Science, стр. 1-13. Springer, (2012)ON THE MATHEMATICAL FOUNDATIONS OF LEARNING, и . (2001)On mixed and componentwise condition numbers for Moore-Penrose inverse and linear least squares problems., , и . Math. Comput., 76 (258): 947-963 (2007)Recursiveness over the Complex Numbers is Time-Bounded., и . FSTTCS, том 761 из Lecture Notes in Computer Science, стр. 260-267. Springer, (1993)Exotic Quantifiers, Complexity Classes, and Complete Problems., и . ICALP, том 4596 из Lecture Notes in Computer Science, стр. 207-218. Springer, (2007)Separation of Complexity Classes in Koiran's Weak Model., , и . Theor. Comput. Sci., 133 (1): 3-14 (1994)Recent Advances in the Computation of the Homology of Semialgebraic Sets.. CiE, том 11558 из Lecture Notes in Computer Science, стр. 1-12. Springer, (2019)