Pseudodeterministic algorithms and the structure of probabilistic time
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 of complete problems. Our main contributions can be summarised as follows. <br> A new unconditional pseudorandom gen...
Main Authors: | Lu, Z, Oliveira, IC, Santhanam, R |
---|---|
פורמט: | Conference item |
שפה: | English |
יצא לאור: |
Association for Computing Machinery
2021
|
פריטים דומים
-
Pseudodeterministic constructions in subexponential time
מאת: Oliveira, I, et al.
יצא לאור: (2017) -
On the Possibilities and Limitations of Pseudodeterministic Algorithms
מאת: Goldreich, Oded, et al.
יצא לאור: (2021) -
Algorithms and algorithmic obstacles for probabilistic combinatorial structures
מאת: Li, Quan, Ph. D. Massachusetts Institute of Technology
יצא לאור: (2018) -
Hardness magnification for natural problems
מאת: Santhanam, R, et al.
יצא לאור: (2018) -
Anti-chain based algorithms for timed/probabilistic refinement checking
מאת: Wang, Ting, et al.
יצא לאור: (2020)