On the complexity of factoring bivariate supersparse (lacunary) polynomials

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn 2005, Issue , 2005, Pages 208-215

  Kaltofen, Erich ^a   Koiran, Pascal ^b  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

Lacunary polynomials; Multivariate polynomials; NP hardness; Polynomial factorizations; Polynomial time complexity; Sparse polynomials

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; POLYNOMIALS; RANDOM PROCESSES;

LACUNARY POLYNOMIALS; MULTIVARIATE POLYNOMIALS; POLYNOMIAL FACTORIZATIONS; POLYNOMIAL TIME COMPLEXITY; SPARSE POLYNOMIALS;

NUMBER THEORY;

EID: 33748977181     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073884.1073914     Document Type: Conference Paper

References (28)

1. AGRAWAL, M., KAYAL, N., AND SAXENA, N. PRIMES is in P. Manuscript, 2002. Available from http://www.cse.iitk.ac.in/news/primality.pdf.
2. BARVINOK, A. I., AND WOODS, K. Short rational generating functions for lattice point problems. J. Amer. Math. Soc. 16 (2003), 957-979.
3. CUCKER, F., KOIRAN, P., AND SMALE, S. A polynomial time algorithm for diophantine equations in one variable. J. Symbolic Comput. 27, 1 (1999), 21-29.
4. DE LOERA, J. A., HEMMECKE, R., HUGGINS, P., STURMFELS, B., AND YOSHIDA, R. Short rational functions for toric algebras and applications. J. Symbolic Comput. 38, 2 (2004), 959-973.
5. DÍAZ, A., AND KALTOFEN, E. On computing greatest common divisors with polynomials given by black boxes for their evaluation. In Proc. 1995 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'95) (New York, N. Y., 1995), A. H. M. Levelt, Ed., ACM Press, pp. 232-239.
6. VON ZUR GATHEN, J., AND GERHARD, J. Modern Computer Algebra. Cambridge University Press, Cambridge, New York, Melbourne, 1999. Second edition 2003.
7. VON ZUR GATHEN, J., KARPINSKI, M., AND SHPARLINSKI, I. Counting curves and their projections. Computational Complexity 6, 1 (1996/1997), 64-99.
8. GOLDSTEIN, A. J., AND GRAHAM, R. L. A Hadamard-type bound on the coefficients of a determinant of polynomials. SIAM Rev. 16 (1974), 394-395.
9. GYORY, K., IWANIEC, H., AND URBANOWICZ, J., Eds. Number Theory in Progress (1999), vol. 1 Diophantine Problems and Polynomials, Stefan Banach Internat. Center, Walter de Gruyter Berlin/New York. Proc. Internat. Conf. Number Theory in Honor of the 60th Birthday of Andrzej Schinzel, Zakopane, Poland June 30-July 9, 1997.
10. HINDRY, M., AND SILVERMAN, J. H. Diophantine Geometry: an Introduction, vol. 201 of Graduate Texts in Mathematics. Springer, 2000.
11. KALTOFEN, E. Sparse Hensel lifting. In EUROCAL 85 European Conf. Comput. Algebra Proc. Vol. 2 (Heidelberg, Germany, 1985), B. F. Caviness, Ed., Lect. Notes Comput. Sci., Springer Verlag, pp. 4-17. Proofs in [12].
12. KALTOFEN, E. Sparse Hensel lifting. Tech. Rep. 85-12, Rensselaer Polytechnic Instit., Dept. Comput. Sci., Troy, N. Y., 1985.
13. KALTOFEN, E. Greatest common divisors of polynomials given by straight-line programs. J. ACM 35, 1 (1988), 231-264.
14. KALTOFEN, E. Polynomial factorization 1987-1991. In Proc. LATIN '92 (Heidelberg, Germany, 1992), I. Simon, Ed., vol. 583 of Lect. Notes Comput. Sci., Springer Verlag, pp. 294-313.
15. KALTOFEN, E. Polynomial factorization: a success story. In ISSAC 2003 Proc. 2003 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 2003), J. R. Sendra, Ed., ACM Press, pp. 3-4. Abstract for invited talk. Slides: http://www.math.ncsu.edu/~kaltofen/bibliography/03/issac.pdf.
16. KALTOFEN, E., AND LEE, W. Early termination in sparse interpolation algorithms. J. Symbolic Comput. 36, 3-4 (2003), 365-400. Special issue Internat. Symp. Symbolic Algebraic Comput. (ISSAC 2002). Guest editors: M. Giusti & L. M. Pardo.
17. KARPINSKI, M., AND SHPARLINSKI, I. On the computational hardness of testing square-freeness of sparse polynomials. In Proc. AAECC-13 (Heidelberg, Germany, 1999), vol. 1719 of Lect. Notes Comput. Sci., Springer Verlag, pp. 492-497.
18. LANG, S. Algebra. Addison-Wesley, 1993.
19. LENSTRA, JR., H. W. Finding small degree factors of lacunary polynomials. In Gyory et al. [9], pp. 267-276.
20. LENSTRA, JR., H. W. On the factorization of lacunary polynomials. In Gyory et al. [9], pp. 277-291.
21. LOOS, R. Computing rational zeros of integral polynomials by p-adic expansion. SIAM J. Comput. 12, 2 (1983), 286-293.
22. PLAISTED, D. A. New NP-hard and NP-complete polynomial and integer divisibility problems. Theoretical Comput. Sci. 13 (1984), 125-138.
23. ROSSER, J. B., AND SCHOENFELD, L. Approximate formulas of some functions of prime numbers. Illinois J. Math. 6 (1962), 64-94.
24. SCHINZEL, A., AND ZANNIER, U. The least admissible value of the parameter in Hubert's Irreducibility Theorem. Acta Arithm. 65 (1995), 371-391.
25. SHPARLINSKI, I. E. Computing Jacobi symbols modulo sparse integers and polynomials and some applications. J. Algorithms 36 (2000), 241-252.
26. SPRINDŽUK, V. G. Arithmetic specializations in polynomials. J. reine angew. Math. 340 (1983), 26-52.
27. WALDSCHMIDT, M. Diophantine approximation on linear algebraic groups. Springer Verlag, Heidelberg, Germany, 2000.
28. ZIPPEL, R. E. Probabilistic algorithms for sparse polynomials. PhD thesis, Massachusetts Inst. of Technology, Cambridge, USA, Sept. 1979.