"Round Complexity Versus Randomness Complexity in Interactive Proofs."

Maya Leshkowitz (2022)

> Home

Details and statistics

DOI: —

access: closed

type: Journal Article

metadata version: 2023-03-02

- view
  - electronic edition @ theoryofcomputing.org
- export record
  dblp key:
  - journals/toc/Leshkowitz22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toc/Leshkowitz22
Maya Leshkowitz:
Round Complexity Versus Randomness Complexity in Interactive Proofs. Theory Comput. 18: 1-65 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.