Registro:

Referencias:

• J. L. Balcázar, J. Díaz, and J. Gabarró, Structural Complexity I, EATCS Monographs on Theoretical Computer Science 11, Springer, 1988; Berkowitz, S.J., On computing the determinant in small parallel time using a small number of processors (1984) Inform. Process. Lett., 18, pp. 147-150
• Brown, W.S., On Euclid's algorithm and the computation of polynomial greatest common divisors (1971) Journal of the ACM, 18, pp. 478-504
• Brownawell, D., Bounds for the degrees in the Nullstellensatz (1987) The Annals of Mathematics, 126, pp. 577-591
• L. Caniglia, Complejidad de algoritmos en geometría computacional, Doctoral Thesis, Universidad de Buennos Aires, 1989; Caniglia, L., Galligo, A., Heintz, J., Borne simple exponentielle pour les degrés dans le théorème des zéros sur un corps de caractéristique quelconque (1988) C. R. Acad. Sci. Paris, Série I Math., 307, pp. 255-258
• L. Caniglia, A. Galligo, and J. Heintz, Some new effectivity bounds in computational geometry, in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Proc. 6th Intern. Conf. AAECC-6, Rome 1988, T. Mora, ed., Springer LN Comput. Sci. 357 (1989), 131–151; L. Caniglia, J.A. Guccione, and J.J. Guccione, Local membership problems for polynomial ideals, in Effective Methods in Algebraic Geometry, Proc. Intern. Conf. MEGA 90, Castiglioncello 1990, T. Mora and C. Traverso, eds., Progress in Mathematics 94, Birkhäuser (1991), 31–45; Dickenstein, A., Fitchas, N., Giusti, M., Sessa, C., The membership problem for unmixed polynomial ideals is solvable in single exponential time (1991) Discrete Appl. Math., 33, pp. 73-94
• Fitchas, N., Galligo, A., Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen-Suslin) pour le Calcul Formel (1990) Mathematische Nachrichten, 149, pp. 231-253
• J. von zur Gathen, Parallel arithmetic computations: a survey, in Proc. 13th Symp. MFCS 1986, Springer LN Comput. Sci.233 (1986), 93–112; M. Giusti and J. Heintz, Algorithmes—disons rapides—pour la décomposition d'une variété algébrique en composantes irréductibles et équidimensionelles, in Effective Methods in Algebraic Geometry, Proc. Intern. Conf. MEGA 90, Castiglioncello 1990, T. Mora and C. Traverso, eds., Progress in Mathematics 94, Birkhäuser (1991a), 169–193; M. Giusti and J. Heintz, La détermination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial, Manuscript, Centre de Mathématiques, École Polytechnique, Palaiseau (1991b). To appear in Proc. Intern. Meeting on Commutative Algebra, Cortona, Cambridge University Press, 1991; Heintz, J., Definability and fast quantifier elimination over algebraically closed fields (1983) Theoret. Comput. Sci., 24, pp. 239-277
• J. Heintz, On the computational complexity of polynomials and bilinear mappings. A survey, in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 5th Intern. Conf. AAECC-5, Menorca 1987, L. Huguet and A. Poli, eds., Springer LN Comput. Sci. 356 (1989), 269–300; J. Heintz and C.P. Schnorr, Testing polynomials which are easy to compute, in Logic and Algorithmic. An International Symposium held in Honour of Ernst Specker, Monographie de l'Enseignement Mathématique, Genève 1982, 237–254; also published in 12th Annual ACM Symp. Theory of Computing (1980), 262–268; J.P. Jouanolou, Théorèmes de Bertini et applications, Progress in Mathematics 42, Birkhäuser 1983; H. Kobayashi, S. Moritsugu and R.W. Hogan, On solving systems of algebraic equations, in Proc. Intern. Symp. on Symbolic and Algebraic Computation, ISSAC 88, Rome 1988, P. Gianni, ed., Springer LN Comp. Sci. 358 (1989); Kollár, J., Sharp effective Nullstellensatz (1988) Journal of the American Mathematical Society, 1, pp. 963-975
• T.Y. Lam, Serre's Conjecture, Springer LN Math. 635 (1978); Matsumura, H., (1989) Commutative ring theory, , Cambridge Studies in Advanced Mathematics, 8, Cambridge University Press, Cambridge
• Mulmuley, K., A fast parallel algorithm to compute the rank of a matrix over an arbitrary field (1987) Combinatorica, 7, pp. 101-104
• F. Rossi and W. Spangher, Some effective methods in the openness of loci for Cohen-Macaulay and Gorenstein properties, in Effective Methods in Algebraic Geometry, Proc. Intern. Conf. MEGA 90, Castiglioncello 1990, T. Mora and C. Traverso, eds., Progress in Mathematics 94, Birkhäuser (1990), 441–455; Stoss, H.-J., On the representation of rational functions of bounded complexity (1989) Theoretical Computer Science, 64, pp. 1-13
• Strassen, V., Berechnung und Programm I (1972) Acta Inform., 1, pp. 320-334
• B. Teissier, Résultats récents d'algèbre commutative effective, in Séminaire Bourbaki, Volume 1989/90, Exposé 718, novembre 1989, Astérisque 189–190 (1991), 107–131; Valiant, L.G., Skyum, S., Berkowitz, S., Rackoff, C., Fast parallel computation of polynomials using few processors (1983) SIAM Journal on Computing, 12, pp. 641-644

Citas:

---------- APA ----------

---------- CHICAGO ----------

---------- MLA ----------

---------- VANCOUVER ----------