NP-hard Sets and Creativeness over Constant Time Languages

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.

Abstract

Abstract is missing.