NL/poly /spl sube/ /spl oplus/L/poly
暂无分享,去创建一个
The article provides logspace analogs of the results of Valiant-Vazirani (L.G. Valiant and V.V. Vazirsni, 1986). We first show that solving STCONN for graphs with at most one st-path is essentially as hard as the general problem, via a probabilistic logspace reduction. We derive from it a nonuniform logspace reduction from NL to /spl oplus/L.<<ETX>>
[1] Avi Wigderson,et al. On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[2] Allan Borodin,et al. On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..
[3] Leslie G. Valiant,et al. NP is as easy as detecting unique solutions , 1985, STOC '85.