The Untold Story of $\mathsf {SBP}$
- 22 June 2020
- book chapter
- Published by Springer Nature
- p. 393-405
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- On the Power of Statistical Zero Knowledge2017
- A Sample of Samplers: A Computational Perspective on SamplingLecture Notes in Computer Science, 2011
- Computational Complexity2009
- Error-bounded probabilistic computations between MA and AMJournal of Computer and System Sciences, 2006
- If NP has polynomial-size circuits, then MA = AMTheoretical Computer Science, 1995
- The Effect of Computerized Tests on the Performance and Attitudes of College StudentsJournal of Educational Computing Research, 1989
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- The complexity of sparse sets in P1986
- Private coins versus public coins in interactive proof systems1986
- Trading group theory for randomness1985