Sparse Complex Polynomials and Polynomial Reducibility

  title={Sparse Complex Polynomials and Polynomial Reducibility},
  author={David A. Plaisted},
  journal={J. Comput. Syst. Sci.},
We show that certain problems involving sparse polynomials wi th integer coefficients are at least as hard as any problem in NP. These problems include determining the degree of the least common multiple of a set of such polynomials, and related problems. The proofs make use of a h o m o m o r p h i s m from Boolean expressions over the predicate symbols (P1 ,..-, P-) onto divisors of the polynomial x N 1, where N is the product of the first n primes. Various combinatorial and n u m b e r… CONTINUE READING
Highly Cited
This paper has 52 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-4 of 4 references

And J

  • A. Allo, J. HOPCROFT
  • ULLMAN, "The Design and Analysis of Computer…
  • 1974
1 Excerpt

The complexity of theorem proving procedures, in "Proceedings of the Third Annual ACM Symposium on Theory of Computing," pp

  • S. CooK
  • 151-158,
  • 1971
1 Excerpt

Modern Algebra Volume II,

  • S. WArnerR
  • 1965

Similar Papers

Loading similar papers…