Pseudodeterminism: promises and lowerbounds
From MaRDI portal
Publication:6083610
DOI10.1145/3519935.3520043MaRDI QIDQ6083610
A. Pavan, Peter B. Dixon, Jason vander Woude, N. V. Vinodchandran
Publication date: 8 December 2023
Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
completenessquery complexityhierarchy theoremspromise problemscircuit lower boundsprobabilistic computationspseudodeterminism
This page was built for publication: Pseudodeterminism: promises and lowerbounds