@inproceedings{9ddc9f539bf24dcaa9c049bd9dd62ae8,
title = "Complete problems for multi-pseudodeterministic computations",
abstract = "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.",
keywords = "Circuit acceptance, Collision probability, Completeness, Entropy approximation, Pseudodeterminism",
author = "Peter Dixon and A. Pavan and Vinodchandran, {N. V.}",
note = "Publisher Copyright: {\textcopyright} Peter Dixon, A. Pavan, and N. V. Vinodchandran.; 12th Innovations in Theoretical Computer Science Conference, ITCS 2021 ; Conference date: 06-01-2021 Through 08-01-2021",
year = "2021",
month = feb,
day = "1",
doi = "10.4230/LIPIcs.ITCS.2021.66",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Lee, {James R.}",
booktitle = "12th Innovations in Theoretical Computer Science Conference, ITCS 2021",
address = "Germany",
}