eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2021-02-04
66:1
66:16
10.4230/LIPIcs.ITCS.2021.66
article
Complete Problems for Multi-Pseudodeterministic Computations
Dixon, Peter
1
Pavan, A.
1
Vinodchandran, N. V.
2
Department of Computer Science, Iowa State University, Ames, IA, USA
Department of Computer Science and Engineering, University of Nebraska, Lincoln, NE, USA
We exhibit several computational problems that are complete for multi-pseudodeterministic computations in the following sense: (1) these problems admit 2-pseudodeterministic algorithms (2) if there exists a pseudodeterministic algorithm for any of these problems, then any multi-valued function that admits a k-pseudodeterministic algorithm for a constant k, also admits a pseudodeterministic algorithm. We also show that these computational problems are complete for Search-BPP: a pseudodeterministic algorithm for any of these problems implies a pseudodeterministic algorithm for all problems in Search-BPP.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol185-itcs2021/LIPIcs.ITCS.2021.66/LIPIcs.ITCS.2021.66.pdf
Pseudodeterminism
Completeness
Collision Probability
Circuit Acceptance
Entropy Approximation