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.

Authors

Neil D. Jones

Identified as Neil D. Jones

William T. Laaser

This author has not been identified. Look up 'William T. Laaser' in Google