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.
@inproceedings{Plaisted77,
title = {New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems},
author = {David A. Plaisted},
year = {1977},
tags = {completeness},
researchr = {https://researchr.org/publication/Plaisted77},
cites = {0},
citedby = {0},
pages = {241-253},
booktitle = {18th Annual Symposium on Foundations of Computer Science, 31 October-2 November, Providence, Rhode Island, USA},
publisher = {IEEE},
}