Complete Problems for Deterministic Polynomial Time

Neil D. Jones, William T. Laaser. Complete Problems for Deterministic Polynomial Time. In Conference Record of Sixth Annual ACM Symposium on Theory of Computing, 30 April-2 May 1974, Seattle, Washington, USA. pages 40-46, ACM, 1974.

@inproceedings{JonesL74,
  title = {Complete Problems for Deterministic Polynomial Time},
  author = {Neil D. Jones and William T. Laaser},
  year = {1974},
  tags = {completeness},
  researchr = {https://researchr.org/publication/JonesL74},
  cites = {0},
  citedby = {0},
  pages = {40-46},
  booktitle = {Conference Record of Sixth Annual ACM Symposium on Theory of Computing, 30 April-2 May 1974, Seattle, Washington, USA},
  publisher = {ACM},
}