Subject
General Computer Science,Theoretical Computer Science
Reference12 articles.
1. M. Aldaz, J. Heintz, G. Matera, J.L. Montaña, L.M. Pardo, Combinatorial hardness proofs for polynomial evaluation, In: Lubos Brim, Jozef Gruska, Jirı́ Zlatuska (Eds.), Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS’98, Brno, Czech Republic, August 24–28, 1998, Vol. 1450 of Lecture Notes in Computer Science, 1998, pp. 167–175.
2. M. Aldaz-Zaragüeta, J. Luis Montaña-Arnaiz, Combinatorial proofs for transcendency of formal power series (extended abstract), Universidad Publica de Navarra, May, 1998.
3. On lower bounds for the complexity of polynomials and their multiples;Baur;Comput. Complexity,1999
4. Complexity and Real Computation;Blum,1998
5. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines;Blum;Bull. AMS,1989