Pseudodeterminism: promises and lowerbounds

From MaRDI portal

Revision as of 06:01, 10 July 2024 by Import240710060729 (talk | contribs) (Created automatically from import240710060729)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6083610

Jump to:navigation, search

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 complexity completeness hierarchy theorems promise problems circuit lower bounds probabilistic computations pseudodeterminism

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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6083610&oldid=35519422"