@inproceedings{44e614f45c84448794ed742b42df08b4,
title = "NL/polyqq⊕L/poly",
abstract = "This note provides logspace analogs of the results of Valiant-Vazirani. 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 N L to ⊕L.",
author = "Avi Wigderson",
year = "1994",
language = "אנגלית",
isbn = "0818656727",
series = "Proceedings of the IEEE Annual Structure in Complexity Theory Conference",
publisher = "Publ by IEEE",
pages = "59--62",
editor = "Anon",
booktitle = "Proceedings of the IEEE Annual Structure in Complexity Theory Conference",
note = "Proceedings of the 9th Annual Structure in Complexity Theory Conference ; Conference date: 28-06-1994 Through 01-07-1994",
}