Theodore P. Baker, Juris Hartmanis. Succinctness, Verifiability and Determinism in Representations of Polynomial-Time Languages. In 20th Annual Symposium on Foundations of Computer Science, 29-31 October 1979, San Juan, Puerto Rico. pages 392-396, IEEE, 1979.
@inproceedings{BakerH79,
title = {Succinctness, Verifiability and Determinism in Representations of Polynomial-Time Languages},
author = {Theodore P. Baker and Juris Hartmanis},
year = {1979},
researchr = {https://researchr.org/publication/BakerH79},
cites = {0},
citedby = {0},
pages = {392-396},
booktitle = {20th Annual Symposium on Foundations of Computer Science, 29-31 October 1979, San Juan, Puerto Rico},
publisher = {IEEE},
}