Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
David A. Plaisted. Some Polynomial and Integer Divisibility Problems Are NP-Hard. In 17th Annual Symposium on Foundations of Computer Science, 25-27 October 1976, Houston, Texas, USA. pages 264-267, IEEE, 1976.
Abstract is missing.