Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference14 articles.
1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, 1992, Proof verification and hardness of approximation problems, Proc. 33rd FOCS Conference, 14, 23
2. P-printable sets;Allender;SIAM J. Comput.,1988
3. E. Allender, M. Strauss, Measure on small complexity classes, with applications for BPP
4. Measure in P: Robustness of the notion;Allender;Lecture Notes in Computer Science,1995
5. L. Babai, L. Fortnow, L. Levin, M. Szegedy, 1991, Checking computations in polylogarithmic time, Proc, 23rd STOC Conference, 21, 31
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献