Funder
Canada Foundation for Innovation
Natural Sciences and Engineering Research Council of Canada
Canadian Institute for Advanced Research
Ontario Research Foundation
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference22 articles.
1. Computational Complexity: A Modern Approach;Arora,2009
2. Non-deterministic exponential time has two-prover interactive protocols;Babai;Comput. Complex.,1991
3. On the Einstein–Podolsky–Rosen paradox;Bell;Physics,1964
4. Multi-prover interactive proofs: how to remove intractability assumptions;Ben-Or,1988
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Removing the Outliers of Diverse Zero-Knowledge Proof Systems using Mahalanobis Distance;Proceedings of the 7th International Conference on Computing Communication and Networking Technologies;2016-07-06
2. Quantum Proofs;Foundations and Trends® in Theoretical Computer Science;2016