Registro:

Referencias:

• Alder, A., (1984) Grenzrang und Grenzkomplexität Aus Algebraischer und Topologischer Sicht, , Ph.D. Thesis, Universität Zürich, Philosophische Fakultät II
• Apt, K.R., Ten years of Hoare's logic: A survey - Part i (1981) ACM Transactions on Programming Languages and Systems (TOPLAS), 3 (4), pp. 431-483
• Babai, L., Fortnow, L., Arithmetization: A new method in structural complexity theory (1991) Computational Complexity, 1, pp. 41-66
• Bareiss, E.H., Sylvester's identity and multistep integer-preserving Gaussian elimination (1968) Mathematics of Computation, 22 (103), pp. 565-578
• Blanco, R., Complexity of Villamayor's algorithm in the non-exceptional monomial case (2009) International Journal of Mathematics, 20 (6), pp. 659-678
• Bloom, T., Calvi, J.-P., A continuity property of multivariate Lagrange interpolation (1997) Mathematics of Computation, 66 (220), pp. 1561-1577
• Blum, L., Cucker, F., Shub, M., Smale, S., (1998) Complexity and Real Computation, , Springer-Verlag
• Blum, L., Shub, M., Smale, S., On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines (1989) Bulletin of the American Mathematical Society, 1 (21), pp. 1-45
• Bürgisser, P., Clausen, M., Shokrollahi, M.A., (1997) Algebraic Complexity Theory, 315. , Grundlehren der Mathematischen Wissenschaften Springer Verlag
• Caniglia, L., Galligo, A., Heintz, J., Some new effectivity bounds in computational geometry (1989) Applied Algebra, Algebraic Algorithms and Error Correcting Codes. Proc. of the 6th Intern. Conference AAECC, Best Paper Award AAECC-6, 357, pp. 131-151. , Springer LNCS
• Castro, D., Giusti, M., Heintz, J., Matera, G., Pardo, L.M., The hardness of polynomial equation solving (2003) Foundations of Computational Mathematics, 3 (4), pp. 347-420. , DOI 10.1007/s10208-002-0065-7
• De Boor, C., Ron, A., The least solution for the polynomial interpolation problem (1992) Mathematische Zeitschrift, 210 (3), pp. 347-378
• Dickenstein, A., Fitchas, N., Giusti, M., Sessa, C., The membership problem of unmixed polynomial ideals is solvable in single exponential time (1991) Discrete Applied Mathematics, 33, pp. 73-94
• Edmonds, J., Systems of distinct representatives and linear algebra (1967) Journal of Research. National Bureau of Standards. Section B, 71, pp. 241-245
• Encinas, S., Villamayor, O., A course on constructive desingularization and equivariance (2000) Resolution of Singularities: A Research Textbook in Tribute to Oscar Zariski, 181, pp. 147-227. , Progress in Mathematics
• Freeman, T., Imirzian, G., Kaltofen, E., A system for manipulating polynomials given by straight-line programs (1986) Proceedings of the Fifth ACM Symposium on Symbolic and Algebraic Computation SYMSAC'86, pp. 169-175. , ACM
• Fulton, W., (1984) Intersection Theory, 2. , Ergebnisse der Mathematik und ihre Grenzgebiete Springer-Verlag Berlin 3. Folge
• Giménez, N., Heintz, J., Matera, G., Solernó, P., Lower complexity bounds for interpolation algorithms (2011) Journal of Complexity, 27, pp. 151-187
• Giusti, M., Hägele, K., Heintz, J., Montaña, J.L., Morais, J.E., Pardo, L.M., Lower bounds for diophantine approximation (1997) Journal of Pure and Applied Algebra, 117, pp. 277-317
• Giusti, M., Heintz, J., La détermination de la dimension et des points isolés d'une variété algébrique peut se faire en temps polynomial (1993) Computational Algebraic Geometry and Commutative Algebra, 34, pp. 216-256. , D. Eisenbud, R. Robbiano, Symposia Mathematica Istituto de Alta Matematica Francesco Severi and Cambridge University Press Cambridge
• Giusti, M., Heintz, J., Kronecker's smart, little black boxes (2001) Foundations of Computational Mathematics, 284, pp. 69-104. , R.A. DeVore, A. Iserles, E. Süli, London Mathematical Society Lecture Note Series Cambridge University Press Cambridge
• Giusti, M., Heintz, J., Kuijpers, B., (2007) The Evaluation of Geometric Queries: Constraint Databases and Quantifier Elimination, , http://alpha.uhasselt.be/~lucp1265/publications/sad.pdf, Manuscript University of Buenos Aires
• Giusti, M., Heintz, J., Morais, J.E., Morgenstern, J., Pardo, L.M., Straight-line programs in geometric elimination theory (1998) Journal of Pure and Applied Algebra, 124 (1-3), pp. 101-146. , PII S0022404996000990
• Giusti, M., Heintz, J., Morais, J.E., Pardo, L.M., The relevance of data structures for elimination problems (1997) Comptes Rendus de l'Academie des Sciences - Series I: Mathematics, 325 (11), pp. 1223-1228
• Giusti, M., Lecerf, G., Salvy, B., A Gröbner free alternative for polynomial system solving (2001) Journal of Complexity, 17 (1), pp. 154-211. , DOI 10.1006/jcom.2000.0571, PII S0885064X00905715
• Grimson, R., Heintz, J., Kuijpers, B., (2011) Evaluating Geometric Queries with Few Arithmetic Operations, , Manuscript University of Buenos Aires
• K. Hägele, (1997) Polynomial Random Test for the Equivalence of Integers Given by Arithmetic Circuits, , Preprint 4/97, Departamento de Matemática, Estadística y Computación, Universidad de Cantabria
• Harris, J., (1992) Algebraic Geometry: A First Course, , second ed. Springer Verlag
• Heintz, J., Definability and fast quantifier elimination in algebraically closed fields (1983) Theoretical Computer Science, 24, pp. 239-277
• Heintz, J., On the computational complexity of polynomials and bilinear mappings. A survey (1989) Proceedings 5th International Symposium on Applied Algebra, Algebraic Algorithms and Error Correcting Codes, 356, pp. 269-300. , Springer LNCS
• Heintz, J., Kuijpers, B., Constraint databases, data structures and efficient query evaluation (2004) Constraint Databases. First International Symposium, 3074, pp. 1-24. , Springer LNCS
• Heintz, J., Matera, G., Pardo, L.M., Wachenchauzer, R., The intrinsic complexity of parametric elimination methods (1998) Electronic Journal of SADIO, 1, pp. 37-51
• Heintz, J., Morgenstern, J., On the intrinsic complexity of elimination theory (1993) Journal of Complexity, 9, pp. 471-498
• Heintz, J., Schnorr, C.P., Testing polynomials which are easy to compute (1982) International Symposium on Logic and Algorithmic Monogr. Enseig. Math., 30, pp. 237-254. , 12th Annual Symposium ACM on Theory of Computing (STOC'80) ACM Press, 262-272, 1980
• Heintz, J., Sieveking, M., Absolute primality of polynomials is decidable in random polynomial time in the number of variables (1981) International Colloquium on Automata, Languages and Programming ICALP, 115, pp. 16-28. , S. Even, O. Kariv, Lecture Notes in Computer Science Springer
• Iversen, B., (1973) Generic Local Structure of the Morphisms in Commutative Algebra, , Springer-Verlag Berlin
• Kabanets, V., Impagliazzo, R., Derandomizing polynomial identity tests means proving circuit lower bounds (2005) Computational Complexity, 13 (1-2), pp. 1-46. , DOI 10.1007/s00037-004-0182-6
• Kaltofen Erich, Greatest common divisors of polynomials given by straight-line programs (1988) Journal of the ACM, 35 (1), pp. 231-264. , DOI 10.1145/42267.45069
• Krick, T., Pardo, L.M., A computational method for diophantine approximation Algorithms in Algebraic Geometry and Applications (1996) Proceedings of MEGA'94 Progress in Mathematics, 143, pp. 193-254
• Kunz, E., (1985) Introduction to Commutative Algebra and Algebraic Geometry, , Birkhäuser Boston
• Lang, S., (1993) Algebra, , Addison-Wesley Massachusetts
• Lickteig, T.M., (1990) On Semialgebraic Decision Complexity, Habilitationsschrift, , Universität Tübingen TR-90-052, Int. Comp. Sc. Inst., Berkeley
• Lipton, R.J., Straight-line complexity and integer factorization (1994) Algorithmic Number Theory, 877, pp. 71-79. , Springer LNCS
• Lund Carsten, Fortnow Lance, Karloff Howard, Nisan Noam, Algebraic methods for interactive proof systems (1992) Journal of the ACM, 39 (4), pp. 859-868. , DOI 10.1145/146585.146605
• Meyer, B., (2000) Object-Oriented Software Construction, , second ed. Prentice-Hall
• Mora, T., (2003) SPES I: The Kronecker-Duval Philosophy, , Cambridge University Press
• Mora, T., (2005) SPES II: Macaulay's Paradigm and Groebner Technology, , Cambridge University Press
• Mulmuley, K., A fast parallel algorithm to compute the rank of a matrix over an arbitrary field (1987) Combinatorica, 7 (1), pp. 101-104
• Mumford, D., (1988) The Red Book of Varieties and Schemes, 1358. , first ed. Springer Berlin, Heidelberg, New York
• Olver, P.J., On multivariate interpolation (2006) Studies in Applied Mathematics, 116 (2), pp. 201-240. , DOI 10.1111/j.1467-9590.2006.00335.x
• Paterson, M.S., Stockmeyer, L.J., On the number of nonscalar multiplications necessary to evaluate polynomials (1973) SIAM Journal on Computing, 2, pp. 60-66
• Saxena, N., Progress on polynomial identity testing (2009) Bulletin of the EATCS, 90, pp. 49-79
• Shafarevich, I.R., (1994) Basic Algebraic Geometry: Varieties in Projective Space, , Springer Berlin, Heidelberg, New York
• Shamir Adi, IP = PSPACE (1992) Journal of the ACM, 39 (4), pp. 869-877. , DOI 10.1145/146585.146609
• Shpilka, A., Arithmetic circuits: A survey of recent results and open questions (2010) Foundations and Trends in Theoretical Computer Science, 5 (34), pp. 207-388
• Shub, M., Smale, S., On the intractability of Hilbert's Nullstellensatz and an algebraic version of NP ≠ P? (1995) Duke Mathematical Journal, 81, pp. 47-54
• Strassen, V., Vermeidung von Divisionen (1973) Crelle Journal für Die Reine und Angewandte Mathematik, 264, pp. 182-202
• Vogel, W., (1984) Results on Bézout's Theorem, , Tata Institute of Fundamental Research Springer
• Zariski, O., Samuel, P., (1960) Commutative Algebra II, 39. , Springer New York

Citas:

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

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

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

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