scientific article; zbMATH DE number 7563815
DOI10.4086/TOC.2022.V018A013OpenAlexW4285169912MaRDI QIDQ5093399FDOQ5093399
Authors: Maya Leshkowitz 
Publication date: 26 July 2022
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2022.v018a013
Title of this publication is not available (Why is that?)
Recommendations
- Round complexity versus randomness complexity in interactive proofs
- Randomness in interactive proofs
- scientific article; zbMATH DE number 7706036
- scientific article; zbMATH DE number 512981
- On the complexity of interactive proofs with bounded communication
- Interactive proofs with approximately commuting provers
- The Round Complexity of Verifiable Secret Sharing Revisited
- scientific article; zbMATH DE number 4087662
- Constant-round interactive proofs for delegating computation
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Theory of computing (68Qxx)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5093399)
