Author:
Naik Ashish V.,Regan Kenneth W.,Sivakumar D.
Publisher
Springer Berlin Heidelberg
Reference40 articles.
1. N. Alon, J. Bruck, J. Naor, M. Naor, and R. Roth. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Trans. Info. Thy., 38(2):509–512, March 1992.
2. A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
3. D. Mix Barrington. Quasipolynomial size circuit classes. In Proc. 7th Structures, pages 86–93, 1992.
4. R. Beigel, M. Bellare, J. Feigenbaum, and S. Goldwasser. Languages that are easier than their proofs. In Proc. 32nd FOCS, pages 19–28, 1991.
5. A. Borodin and A. Demers. Some comments on functional self-reducibility and the NP hierarchy. Technical Report TR 76–284, Cornell Univ. Comp. Sci. Dept., 1976.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献