Piotr Berman. Relationship Between Density and Deterministic Complexity of NP-Complete Languages. In Giorgio Ausiello, Corrado Böhm, editors, Automata, Languages and Programming, Fifth Colloquium, Udine, Italy, July 17-21, 1978, Proceedings. Volume 62 of Lecture Notes in Computer Science, pages 63-71, Springer, 1978.
@inproceedings{Berman78,
title = {Relationship Between Density and Deterministic Complexity of NP-Complete Languages},
author = {Piotr Berman},
year = {1978},
tags = {completeness},
researchr = {https://researchr.org/publication/Berman78},
cites = {0},
citedby = {0},
pages = {63-71},
booktitle = {Automata, Languages and Programming, Fifth Colloquium, Udine, Italy, July 17-21, 1978, Proceedings},
editor = {Giorgio Ausiello and Corrado Böhm},
volume = {62},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-08860-1},
}