Some polynomial and integer divisibility problems are NP-HARD

@article{Plaisted1976SomePA,
  title={Some polynomial and integer divisibility problems are NP-HARD},
  author={David A. Plaisted},
  journal={17th Annual Symposium on Foundations of Computer Science (sfcs 1976)},
  year={1976},
  pages={264-267}
}
In an earlier paper [1], the author showed that certain problems involving sparse polynomials and integers are NP-hard. In this paper we show that many related problems are also NP-hard. In addition, we exhibit some new NP-complete problems. Most of the new results concern problems in which the nondeterminism is "hidden". That is, the problems are not explicitly stated in terms of one of a number of possibilities being true. Furthermore, most of these problems are in the areas of number theory… CONTINUE READING
Highly Cited
This paper has 44 citations. REVIEW CITATIONS