NL/poly /spl sube/ /spl oplus/L/poly

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI:10.1109/SCT.1994.315817

A. Wigderson

引用次数: 25

Abstract

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.<>

查看原文本刊更多论文

NL/poly /spl subbe / /spl oplus/L/poly

本文提供了Valiant- vazirani (L.G. Valiant and V.V. Vazirsni, 1986)结果的对数空间类比。我们首先表明，通过概率对数空间约简，解决最多有一个st路径的图的STCONN本质上与一般问题一样困难。由此导出了NL到/spl + / l / >的非一致对数空间约简

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory

自引率

0.00%

发文量