Newton symmetric functions and the arithmetic of algebraically closed fields

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

Volumn 356 LNCS, Issue , 1989, Pages 216-224

  Dvornicich, Roberto ^a   Traverso, Carlo ^b  

^a UNIVERSITY OF CALABRIA   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

ABSOLUTE FACTORIZATION; ABSOLUTE IRREDUCIBILITY; COMPLEX NUMBER; EXPLICIT FORMULA; SYMMETRIC FUNCTIONS;

POLYNOMIALS;

EID: 0001241610     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-51082-6_79     Document Type: Conference Paper

References (9)

1. A. Ba Baker, “Transcendental Number Theory,” Cambridge University Press, 1975.
2. BCL B. Buchberger, G. E. Collins, R. Loos, “Computer Algebra,” Springer Verlag, Wien-New York, 1982.
3. P. L. Ci Cijsouw, “Trancendence Measures,” (Ph.D. Thesis), Academic Services, Vinkeveen, 1972.
4. DD C. Di Crescenzo, D. Dural, Computation on Curves, in “EUROSAM 84,” Lecture Notes in Computer Science 174, Springer Verlag, Berlin-Heidelberg-New York, 1984, pp. 100-108.
5. E. Ka Kaltofen, A Fast Absolute Irreducibility Criterion, Journal of Symbolic Comp. 1 (1985).
6. S. La Lang, A Trancendence Measure for E-functions, Mathematika 9 (1962), 157-161.
7. R. Lo Loos, Computing in Algebraic Extensions, in “Computer Algebra” (BCL), pp. 173-187.
8. J. G. Sa Macdonald, “Symmetric Functions and the Hall Polynomials,” Clarendon Pzess, Oxford, 1979.
9. M. Mi Mignotte, Some Useful Boun&, in “Computer Algebra” (BCL), pp. 259-262.