Pseudodeterministic algorithms and the structure of probabilistic time
From MaRDI portal
Publication:6087003
DOI10.1145/3406325.3451085arXiv2103.08539OpenAlexW3144311280MaRDI QIDQ6087003
Zhenjian Lu, Igor C. Oliveira, Rahul Santhanam
Publication date: 14 November 2023
Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.08539
Kolmogorov complexitypseudorandom generatorshierarchy theoremsprobabilistic timepseudodeterministic algorithms
This page was built for publication: Pseudodeterministic algorithms and the structure of probabilistic time