Registro:

Referencias:

• Amoroso, F., Test d'appartenance d'après un théorème de Kollár (1989) C. R. Acad. Sci. Paris Sér. I, 309, pp. 691-694
• Armendáriz, I., (1992) La Complejidad del Cálculo de la Dimensión de Una Variedad Algebraica, , Master Thesis, Universidad de Buenos Aires
• Berenstein, C., Yger, A., Bounds for the degrees in the division problem (1990) Michigan Math. J., 37, pp. 25-43
• 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
• Brownawell, W.D., Bounds for the degrees in the Nullstellensatz (1987) Ann. Math. (Second Series), 126 (3), pp. 577-591
• 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ér. I, 307, pp. 255-258
• Caniglia, L., Galligo, A., Heintz, J., Some new effectivity bounds in computational geometry (1989) Lecture Notes in Computer Science, 357, pp. 131-151. , T. Mora, ed., Proc. 6th Internat. Conf. Applied Algebra, Algebraic Algorithms and Error Correcting Codes AAECC-6 (Rome, 1988) Springer, Berlin
• Caniglia, L., Guccione, J.A., Guccione, J.J., Local membership problems for polynomial ideals (1991) Effective Methods in Algebraic Geometry MEGA 90, Progress in Mathematics, 94, pp. 31-45. , T. Mora and C. Traverso, eds., Birkhäuser, Basel
• Canny, J., Some algebraic and geometric computations in PSPACE (1988) Proc. 20th Ann. ACM Symp. Theory of Computing, pp. 460-467
• Canny, J., Generalized characteristic polynomials (1989) Lecture Notes in Computer Science, 358, pp. 293-299. , P. Gianni, ed., Proc. Internat. Symp. on Symbolic and Algebraic Computation ISSAC'88 (Roma, 1988) Springer, Berlin
• Dickenstein, A., Giusti, M., Fitchas, N., Sessa, V., 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) Math. Nachr., 149, pp. 231-253
• Fitchas, N., Galligo, A., Morgenstern, J., Precise sequential and parallel complexity bounds for the quantifier elimination over algebraically closed fields (1990) J. Pure Appl. Algebra, 67, pp. 1-14
• Fitchas, N., Giusti, M., Smietanski, F., (1992) Sur la Complexité du Théorème des Zéros, , Preprint Ecole Polytechnique Palaiseau
• Von Zur Gathen, J., Parallel arithmetic computations: A survey (1986) Lecture Notes in Computer Science, 233, pp. 93-112. , Proc. 13th Conf. MFCS, Springer, Berlin
• Giusti, M., Heintz, J., La détermination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial (1991) Proc. Internat. Meeting on Commutative Algebra, , Cortona, To appear
• Giusti, M., Heintz, J., Sabia, J., On the efficiency of effective Nullstellensätze Computational Complexity, , To appear
• Grigor'ev, D., Karpinski, M., Singer, M., (1989) The Interpolation Problem for K-sparse Sums of Eigenfunctions of Operators, , Research Report 8538-CS, Universität Bonn
• Heintz, J., Definability and fast quantifier elimination in algebraically closed fields (1983) Theoret. Comput. Sci., 24, pp. 239-277
• Heintz, J., Morgenstern, J., (1993) On the Intrinsic Complexity of Elimination Theory, , Depart, de Mat. y Estad. Comput., Universidad de Cantabria No.2
• Heintz, J., Schnorr, C.P., Testing polynomials which are easy to compute (1980) Proc. 12th Ann. ACM Symp, Theory of Computing, pp. 262-280
• Heintz, J., Sieveking, M., Absolute primality of polynomials is decidable in random polynomial time in the number of variables (1981) Lecture Notes in Computer Science, 115, pp. 16-28. , S. Even and O. Kariv, eds., Proc. 8th Colloquium on Automata, Languages and Programming ICALP 81 (Akko, 1981) Springer, Berlin
• Hermann, G., Die Frage der endlich vielen Schritte in der Theorie der Polynomideale (1926) Math. Ann., 95, pp. 736-788
• Ierardi, D., Quantifier elimination in the theory of an algebraically-closed field (1989) Proc. 21st Ann. ACM Symp. Theory of Computing, pp. 138-147
• Jouanolou, J.P., (1990) Le Formalisme du Résultant, , Preprint IRMA, Université de Strasbourg
• Kaltofen, E., Greatest common divisors of polynomials given by straight line programs (1988) J. ACM, 35 (1), pp. 234-264
• Kollár, J., Sharp effective Nullstellensatz (1988) J. AMS, 1, pp. 963-975
• Lazard, D., Résolution des systèmes d'équations algébriques (1981) Theoret. Comput. Sci., 15, pp. 77-110
• Mayr, E., Meyer, A., The complexity of the word problem for commutative semigroups and polynomial ideals (1982) Adv. in Math., 46, pp. 305-329
• Mulmuley, K., A fast parallel algorithm to compute the rank of a matrix over an arbitrary field (1986) Proc. 18th Ann. Symp. Theory of Computing, pp. 338-339
• Sabia, J., Solernó, P., (1993) A Bound for the Trace in Complete Intersections and the Degrees in the Nullstellensatz, , Preprint
• Shiffman, B., Degree bounds for the division problem in polynomial ideals (1989) Michigan Math. J., 36, pp. 163-171
• Stoss, H.-J., On the representation of rational functions of bounded complexity (1989) Theoret. Comput. Sci., 64, pp. 1-13
• Strassen, V., Berechnung und Programm I (1972) Acta Inform., 1, pp. 320-334
• Van Der Waerden, B.L., (1940) Moderne Algebra, 2. , Springer, Berlin

Citas:

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

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

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

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