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...
Những tác giả chính: | Lu, Z, Oliveira, IC, Santhanam, R |
---|---|
Định dạng: | Conference item |
Ngôn ngữ: | English |
Được phát hành: |
Association for Computing Machinery
2021
|
Những quyển sách tương tự
-
Pseudodeterministic constructions in subexponential time
Bằng: Oliveira, I, et al.
Được phát hành: (2017) -
On the Possibilities and Limitations of Pseudodeterministic Algorithms
Bằng: Goldreich, Oded, et al.
Được phát hành: (2021) -
Algorithms and algorithmic obstacles for probabilistic combinatorial structures
Bằng: Li, Quan, Ph. D. Massachusetts Institute of Technology
Được phát hành: (2018) -
Hardness magnification for natural problems
Bằng: Santhanam, R, et al.
Được phát hành: (2018) -
Anti-chain based algorithms for timed/probabilistic refinement checking
Bằng: Wang, Ting, et al.
Được phát hành: (2020)