Some Polynomial and Integer Divisibility problems are NP-Hard

David A. Plaisted. Some Polynomial and Integer Divisibility problems are NP-Hard. SIAM Journal on Computing, 7(4):458-464, 1978.

Abstract

Abstract is missing.