Subject
General Computer Science,Theoretical Computer Science
Reference35 articles.
1. Quantum computability;Adleman;SIAM J. Comput.,1997
2. Random walks, universal traversal sequences, and the complexity of maze problems;Aleliunas,1979
3. Proof verification and the hardness of approximation problems;Arora;J. ACM,1998
4. Non-deterministic exponential time has two-prover interactive protocols;Babai;Comput. Complexity,1991
Cited by
52 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献