# Sparse Complex Polynomials and Polynomial Reducibility

@article{Plaisted1977SparseCP, title={Sparse Complex Polynomials and Polynomial Reducibility}, author={David A. Plaisted}, journal={J. Comput. Syst. Sci.}, year={1977}, volume={14}, pages={210-221} }

- Published 1977 in J. Comput. Syst. Sci.
DOI:10.1016/S0022-0000(77)80013-5

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.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

Showing 1-4 of 4 references