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...
Príomhchruthaitheoirí: | Lu, Z, Oliveira, IC, Santhanam, R |
---|---|
Formáid: | Conference item |
Teanga: | English |
Foilsithe / Cruthaithe: |
Association for Computing Machinery
2021
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Pseudodeterministic constructions in subexponential time
de réir: Oliveira, I, et al.
Foilsithe / Cruthaithe: (2017) -
On the Possibilities and Limitations of Pseudodeterministic Algorithms
de réir: Goldreich, Oded, et al.
Foilsithe / Cruthaithe: (2021) -
Algorithms and algorithmic obstacles for probabilistic combinatorial structures
de réir: Li, Quan, Ph. D. Massachusetts Institute of Technology
Foilsithe / Cruthaithe: (2018) -
Hardness magnification for natural problems
de réir: Santhanam, R, et al.
Foilsithe / Cruthaithe: (2018) -
Anti-chain based algorithms for timed/probabilistic refinement checking
de réir: Wang, Ting, et al.
Foilsithe / Cruthaithe: (2020)