Additive complexity and roots of polynomials over number fields and p-adic fields

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2369, Issue , 2002, Pages 506-515

  Rojas, J Maurice ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMMUNICATION SYSTEMS; NUMBER THEORY;

ALGEBRAIC EXPRESSION; BOUNDED DEGREE; COMPLEXITY THEORY; FINITE EXTENSION; MULTIVARIATE POLYNOMIAL; NUMBER FIELDS; RATIONAL COEFFICIENTS; ROOTS OF POLYNOMIALS;

POLYNOMIALS;

EID: 36349032073     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45455-1_39     Document Type: Conference Paper

References (14)

1. Blum, Lenore; Cucker, Felipe; Shub, Mike; and Smale, Steve, Complexity and Real Computation, Springer-Verlag, 1998.
2. Borodin, Allan and Cook, Stephen A., “On the Number of Additions to Compute Specific Polynomials,” SIAM J. Comput. 5 (1976), no. 1, pp. 146–157.
3. Fulton, William, Intersection Theory, 2nd ed., Ergebnisse der Mathematik und ihrer Grenzgebiete 3, 2, Springer-Verlag, 1998.
4. Grigor’ev, Dima Yu., “Lower Bounds in the Algebraic Complexity of Computations,” The Theory of the Complexity of Computations, I; Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov (LOMI) 118 (1982), pp. 25–82
5. Khovanski, Askold G., “On a Class of Systems of Transcendental Equations,” Dokl. Akad. Nauk SSSR 255 (1980), no. 4, pp. 804–807; English transl. in Soviet Math. Dokl. 22 (1980), no. 3.
6. Khovanski, Askold G. Fewnomials, AMS Press, Providence, Rhode Island, 1991.
7. Koblitz, Neal I., p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd ed., Graduate Texts in Mathematics, 58, Springer-Verlag, New York-Berlin, 1984.
8. Lenstra, Hendrik W., “On the Factorization of Lacunary Polynomials,” Number Theory in Progress, Vol. 1 (Zakopane-Koscielisko, 1997), pp. 277–291, de Gruyter, Berlin, 1999.
9. Risler, Jean-Jacques, “Additive Complexity and Zeros of Real Polynomials,” SIAM J. Comput. 14 (1985), no. 1, pp. 178–183.
10. Rojas, J. Maurice, “Toric Intersection Theory for Affine Root Counting,” Journal of Pure and Applied Algebra, vol. 136, no. 1, March, 1999, pp. 67–100.
11. Rojas, J. Maurice “Algebraic Geometry Over Four Rings and the Frontier to Tractability,” Contemporary Mathematics, vol. 270, Proceedings of a Conference on Hilbert’s Tenth Problem and Related Subjects (University of Gent, November 1–5, 1999), edited by Jan Denef, Leonard Lipschitz, Thanases Pheidas, and Jan Van Geel, pp. 275–321, AMS Press (2000).
12. Rojas, J. Maurice “Arithmetic Multivariate Descartes’ Rule,” Math ArXiV preprint math.NT/0110327, submitted for publication.
13. Shub, Mike, “Some Remarks on Bézout’s Theorem and Complexity Theory,” From Topology to Computation: Proceedings of the Smalefest (Berkeley, 1990), pp. 443–455, Springer-Verlag, 1993.
14. Smirnov, Andrei L., “Torus Schemes Over a Discrete Valuation Ring,” St. Petersburg Math. J. 8 (1997), no. 4, pp. 651–659.