Author:
Hemachandra Lane A.,Silvestri Riccardo
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. V. Arvind and S. Biswas. Kernel constructible languages. In Record of the 3rd Conference on Foundations of Software Technology and Theoretical Computer Science, pages 520–538. National Centre for Software Development and Computing Technique, Tata Institute of Fundamental Research, Dec. 1983.
2. V. Arvind and S. Biswas. On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulas. Theoretical Computer Science, 68(1):1–14, 1989.
3. L. Berman and J. Hartmanis. On isomorphisms and density of NP and other complete sets. SIAM Journal on Computing, 6(2):305–322, 1977.
4. J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung. The boolean hierarchy II: Applications. SIAM Journal on Computing, 18(1):95–111, 1989.
5. S. Fenner, L. Fortnow, and S. Kurtz. An oracle relative to which the isomorphism conjecture holds. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pages 30–39. IEEE Computer Society Press, Oct. 1992.