<?xml version="1.0" encoding="US-ASCII"?>
<dblp>
<inproceedings key="conf/focs/Plaisted76" mdate="2023-03-23">
<title>Some Polynomial and Integer Divisibility Problems Are NP-Hard</title>
<author>David A. Plaisted</author>
<pages>264-267</pages>
<crossref>conf/focs/FOCS17</crossref>
<year>1976</year>
<booktitle>FOCS</booktitle>
<url>db/conf/focs/focs76.html#Plaisted76</url>
<ee>https://doi.org/10.1109/SFCS.1976.29</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/SFCS.1976.29</ee>
</inproceedings></dblp>
