Pseudodeterminism: promises and lowerbounds

DOI10.1145/3519935.3520043MaRDI QIDQ6083610FDOQ6083610

Aduri 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)

zbMATH Keywords

query complexitycompletenesshierarchy theoremspromise problemscircuit lower boundsprobabilistic computationspseudodeterminism

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited In (1)

• On the possibilities and limitations of pseudodeterministic algorithms

This page was built for publication: Pseudodeterminism: promises and lowerbounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6083610)