Extended Hilbert Irreducibility and Its Applications

Journal of Algorithms

Volumn 37, Issue 1, 2000, Pages 121-145

  Huang, Ming Deh ^a   Wong, Yiu Chung ^a,b  

^a University of Southern California   (United States)

^b SYNOPSYS INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0348000553     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1098     Document Type: Article

References (24)

1. A. L. Chistov, Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time. J. Soviet Math. 34 (1986), 1838-1882.
2. A. L. Chistov and D. Yu. Grigor'ev, Subexponential-time solving systems of algebraic equations, II. Preprint E-5-82, LOMI, Leningrad, 1983.
3. S. D. Cohen, The distribution of Galois groups and Hilbert irreducibility theorem, Proc. London Math. Soc. 43 (1981), 227-250.
4. P. Debes, Hilbert subsets and s-integral points, Manuscripta Math. 89 (1996), 107-137.
5. A. Dickenstein, N. Fitchas, M. Giusti, and C. Sessa, The membership problem for unmixed polynomial ideals is solvable in single exponential time, Discrete Appl. Math. 33 (1991), 73-94.
6. J. von zur Gathen, Irreducibility of multivariate polynomials, J. Comput. System Sci. 31 (1985), 225-264.
7. J. von zur Gathen and E. Kaltofen, Factoring sparse multivariate polynomials, J. Comput. System Sci. 31 (1985), 265-287.
8. M. Giusti and J. Heintz, Algorithmes - disons rapides - pour la décomposition d'une variété algébrique en composantes irréductibles et équidimensionnelles, in "Effective Methods in Algebraic Geometry," (T. Mora and C. Traverso, Ed.), Progress in Mathematics, Vol. 94, pp. 169-194, Birkhäuser, Basel, 1991.
9. M. Giusti and J. Heintz, "La détermination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial," Cambridge University Press, Cambridge, UK, 1993.
10. D. Yu. Grigor'ev, Factorization of polynomials over a finite field and the solution of systems of algebraic equations, J. Soviet Math. 34 (1986), 1762-1803.
11. M.-D. Huang and A. Rao, Interpolation of sparse multivariate polynomials over finite fields with applications, in "Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 508-517, 1996.
12. M.-D. Huang and Y.-C. Wong, Solving systems of polynomial congruences modulo a large prime, in "Proceedings of IEEE Symposium on Foundations of Computer Science," pp. 115-124, 1996.
13. D. J. Ierardi, "The Complexity of Quantifier Elimination in the Theory of an Algebraically Closed Field," PhD thesis, Department of Computer Science, Cornell University, Ithaca, NY, 1989. [Also available as Technical Report TR 89-1030 of Computer Science Department, Cornell University.]
14. D. Ierardi and D. Kozen, Parallel resultant computation, in "Synthesis of Parallel Algorithms," Kauffman, San Mateo, CA, 1991.
15. E. Kaltofen, Effective Hilbert irreducibility, Inform, and Control 66 (1985), 123-137.
16. E. Kaltofen, Factorization of polynomials given by straight-line programs, in "Randomness in Computation," (S. Micali, Ed.), Advances in Computing Research, Vol. 5, pp. 375-412, JAI Press, Greenwich, CT, 1989.
17. E. Kaltofen, Effective Noether irreducibility forms and applications, J. Comput. System Sci. 50 (1995), 274-295.
18. E. Kaltofen and B. M. Trager, Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators, J. Symbolic Comput. 9 (1990), 300-320.
19. S. Lang, "Diophantine Geometry," Interscience tracts in pure and applied mathematics, Vol. 11, Interscience, New York, 1962.
20. A. Schinzel and U. Zannier, The least admissible value of the parameter in Hilbert's irreducibility theorem. Acta Arith. 69 (1995), 293-302.
21. I. R. Shafarevich, "Basic Algebraic Geometry 1: Varieties in Projective Space," second edition, Springer-Verlag, Berlin/New York, 1994.
22. A. J. Sommese and C. W. Wampler, Numerical algebraic geometry, in "The Mathematics of Numerical Analysis: Real Number Algorithms, Park City, Utah, Summer 1995" (J. Renegar, M. Shub, and S. Smale, ed.), Lectures in Applied Math., Vol. 32, pp. 749-763, Amer. Math. Soc., Providence, RI, 1996.
23. D. Wan, Hilbert sets and zeta functions over finite fields, J. Reine. Angew. Math. 427 (1992), 193-207.
24. U. Zannier, Note on dense universal hilbert sets, C.R. Acad. Sci. Paris, Ser. I 322 (1996), 703-706.