We connect the study of pseudodeterministic algorithms to two major open problems about
the structural complexity of BPTIME: proving hierarchy theorems and showing the existence …

A probabilistic algorithm A is pseudodeterministic if, on every input, there exists a canonical
value that is output with high probability. If the algorithm outputs one of k canonical values …