NL/poly /spl subbe / /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

{"title":"NL/poly /spl subbe / /spl oplus/L/poly","authors":"A. Wigderson","doi":"10.1109/SCT.1994.315817","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"NL/poly /spl sube/ /spl oplus/L/poly\",\"authors\":\"A. Wigderson\",\"doi\":\"10.1109/SCT.1994.315817\",\"DOIUrl\":null,\"url\":null,\"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.<<ETX>>\",\"PeriodicalId\":386782,\"journal\":{\"name\":\"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCT.1994.315817\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1994.315817","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 25

摘要

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

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

查看原文本刊更多论文

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

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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

自引率

0.00%

发文量