Manindra Agrawal. NP-hard Sets and Creativeness over Constant Time Languages. In Somenath Biswas, Kesav V. Nori, editors, Foundations of Software Technology and Theoretical Computer Science, 11th Conference, New Delhi, India, December 17-19, 1991, Proceedings. Volume 560 of Lecture Notes in Computer Science, pages 224-241, Springer, 1991.
@inproceedings{Agrawal91:0,
title = {NP-hard Sets and Creativeness over Constant Time Languages},
author = {Manindra Agrawal},
year = {1991},
researchr = {https://researchr.org/publication/Agrawal91%3A0},
cites = {0},
citedby = {0},
pages = {224-241},
booktitle = {Foundations of Software Technology and Theoretical Computer Science, 11th Conference, New Delhi, India, December 17-19, 1991, Proceedings},
editor = {Somenath Biswas and Kesav V. Nori},
volume = {560},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-54967-6},
}