Author:
Hemaspaandra Lane A.,Thakur Mayur
Subject
General Computer Science,Theoretical Computer Science
Reference38 articles.
1. P-printable sets;Allender;SIAM J. Comput,1988
2. B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, K. Yang, On the (im)possibility of obfuscating programs, Report 2001/069, Cryptology ePrint Archive, August 2001 (preliminary version appears in Advances in Cryptology—CRYPTO 2001).
3. On the unique satisfiability problem;Blass;Inform. Control,1982
4. Restrictive acceptance suffices for equivalence problems;Borchert;London Math. Soc. J. Comput. Math,2000
5. Looking for an analogue of Rice's Theorem in circuit complexity theory;Borchert;Math. Logic Quart,2000
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献