左集技术的相对限制和稀疏集的闭包类

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI:10.1109/SCT.1993.336524

Sanjeev Saluja

{"title":"左集技术的相对限制和稀疏集的闭包类","authors":"Sanjeev Saluja","doi":"10.1109/SCT.1993.336524","DOIUrl":null,"url":null,"abstract":"A number of theorems are proved by introducing the notion of k-families of sets of strings, and an algorithm which outputs the sets of certain k-families is given. The algorithm is used to disjunctively reduce the left set (or 1wdsr set) to a sparse set. The set output by the algorithm on an input corresponds to the set queried by the disjunctive reduction on the input.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Relativized limitations of left set technique and closure classes of sparse sets\",\"authors\":\"Sanjeev Saluja\",\"doi\":\"10.1109/SCT.1993.336524\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A number of theorems are proved by introducing the notion of k-families of sets of strings, and an algorithm which outputs the sets of certain k-families is given. The algorithm is used to disjunctively reduce the left set (or 1wdsr set) to a sparse set. The set output by the algorithm on an input corresponds to the set queried by the disjunctive reduction on the input.<<ETX>>\",\"PeriodicalId\":331616,\"journal\":{\"name\":\"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCT.1993.336524\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1993.336524","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 15

摘要

通过引入字符串集合的k族概念，证明了若干定理，并给出了一个输出若干k族集合的算法。该算法用于将左集(或1wdsr集)析取约简为稀疏集。算法在输入上输出的集合对应于在输入上析取约简查询的集合。

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

查看原文本刊更多论文

Relativized limitations of left set technique and closure classes of sparse sets

A number of theorems are proved by introducing the notion of k-families of sets of strings, and an algorithm which outputs the sets of certain k-families is given. The algorithm is used to disjunctively reduce the left set (or 1wdsr set) to a sparse set. The set output by the algorithm on an input corresponds to the set queried by the disjunctive reduction on the input.<>

求助全文

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

来源期刊

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference

自引率

0.00%

发文量