New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems

David A. Plaisted. New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems. Theoretical Computer Science, 31:125-138, 1984.

Abstract

Abstract is missing.