Absolute primality of polynomials is decidable in random polynomial time in the number of variables

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

Volumn 115 LNCS, Issue , 1981, Pages 16-28

  Heintz, Joos ^a   Sieveking, Malte ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; POLYNOMIAL APPROXIMATION;

INFINITE FIELDS; PRIMALITY; RANDOM POLYNOMIALS; TIME POLYNOMIALS;

POLYNOMIALS;

EID: 0002694831     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-10843-2_2     Document Type: Conference Paper

References (10)

1. Heintz, J.: Definability Bounds of First Order Theories of Algebraically Closed Fields (Abstract). Proc. Fundamentals of Computation Theory FCT’79 (1979), p. 160–166.
2. Heintz, J.: (1977) (unpublished).
3. Heintz, J.: Towards a Decision Procedure for Prime Ideals in Polynomial Rings. Report on the 1979 Oberwolfach Conference on Complexity Theory, (1979).
4. Heintz, J., Schnorr, C.P.: Testing Polynomials which are Easy to Compute. 12 th Annual Symp. ACM on Computing, (1980), p. 262–272.
5. Heintz, J., Wüthrich, R.: An Efficient Quantifier Elimination Algorithm for Algebraically Closed Fields of Any Characteristic. SIGSAM Bull. Vol. 9, No 4, (1975), p. 11.
6. Herrmann, G.: Die Frage der endlich vielen Schritten in der Theorie der Polynomideale. Math. Ann. 95 (1926), p. 736–788.
7. Kendig, K.: Elementary Algebraic Geometry. New York, Springer Verlag, (1970).
8. Lang, S.: Introduction to Algebraic Geometry. New York, Interscience, (1964).
9. Šafarevič, I.R.: Osnovy Algebraičeskoj Geometrii. Moskva, Nauka, (1972). English Translation: Basic Algebraic Geometry. Springer Verlag, (1974).
10. Seidenberg, A.: Constructions in Algebra. Trans. AMS, Vol. 194, (1974), p. 273–313.