Some polynomial and integer divisibility problems are NP-HARD | IEEE Conference Publication | IEEE Xplore