Author:
Chang Richard,Chor Benny,Goldreich Oded,Hartmanis Juris,Håstad Johan,Ranjan Desh,Rohatgi Pankaj
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference35 articles.
1. Trading group theory for randomness;Babai,1985
2. Non-deterministic exponential time has two-prover interactive protocols;Babai;Comput. Complexity,1991
3. Relativizations of the P = ?NP question;Baker;SIAM J. Comput.,1975
4. Multi-prover interactive proofs: How to remove the intractability assumptions;Ben-Or,1988
5. Relative to a random oracle A, PA ≠ NPA ≠ co-NPA with probability 1;Bennett;SIAM J. Comput.,1981
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献