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. Complete Divisibility Problems for Slowly Utilized Oracles. Theoretical Computer Science, 35:245-260, 1985.
Possibly Related PublicationsThe following publications are possibly variants of this publication: New NP-Hard and NP-Complete Polynomial and Integer Divisibility ProblemsDavid A. Plaisted. focs 1977: 241-253 New NP-Hard and NP-Complete Polynomial and Integer Divisibility ProblemsDavid A. Plaisted. TCS, 31:125-138, 1984.
The following publications are possibly variants of this publication: