LIPIcs.APPROX-RANDOM.2018.49.pdf
- Filesize: 492 kB
- 16 pages
Consider an interactive proof system for some set S that has randomness complexity r(n) for instances of length n, and arbitrary round complexity. We show a public-coin interactive proof system for S of round complexity O(r(n)/log n). Furthermore, the randomness complexity is preserved up to a constant factor, and the resulting interactive proof system has perfect completeness.
Feedback for Dagstuhl Publishing