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. In 18th Annual Symposium on Foundations of Computer Science, 31 October-2 November, Providence, Rhode Island, USA. pages 241-253, IEEE, 1977.

Abstract

Abstract is missing.