Undirected connectivity in log-space
Journal of the ACM (JACM)
S-T connectivity on digraphs with a known stationary distribution
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
There exists a positive constant \alpha \le 1 such that for any function T(n)\leqslant n^{\alpha} and for any problem L \in BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time which decides L, except for at most a 2^{-\Omega ...