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. 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.
Possibly Related PublicationsThe following publications are possibly variants of this publication: New NP-Hard and NP-Complete Polynomial and Integer Divisibility ProblemsDavid A. Plaisted. TCS, 31:125-138, 1984. Some Polynomial and Integer Divisibility Problems Are NP-HardDavid A. Plaisted. focs 1976: 264-267 Some Polynomial and Integer Divisibility problems are NP-HardDavid A. Plaisted. SICOMP, 7(4):458-464, 1978.
The following publications are possibly variants of this publication: