关于超滤和NP

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

S. Ben-David, M. Karchmer, E. Kushilevitz

{"title":"关于超滤和NP","authors":"S. Ben-David, M. Karchmer, E. Kushilevitz","doi":"10.1109/SCT.1994.315813","DOIUrl":null,"url":null,"abstract":"The fusion method (A. Wigderson, 1993) is developed by exploring its similarities with the ultraproduct construction in model theory. We use this analogy to re-prove a result of M. Sipser (1984) regarding countable circuits, in a simpler way. In the finite case this analogy allows us to give a new characterization of co-NP in terms of the CLIQUE function. This gives a natural interpretation to the NP-completeness of the CLIQUE function.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On ultrafilters and NP\",\"authors\":\"S. Ben-David, M. Karchmer, E. Kushilevitz\",\"doi\":\"10.1109/SCT.1994.315813\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The fusion method (A. Wigderson, 1993) is developed by exploring its similarities with the ultraproduct construction in model theory. We use this analogy to re-prove a result of M. Sipser (1984) regarding countable circuits, in a simpler way. In the finite case this analogy allows us to give a new characterization of co-NP in terms of the CLIQUE function. This gives a natural interpretation to the NP-completeness of the CLIQUE function.<<ETX>>\",\"PeriodicalId\":386782,\"journal\":{\"name\":\"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"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.315813\",\"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.315813","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

融合方法(A. Wigderson, 1993)是通过探索其与模型理论中的超积构造的相似性而发展起来的。我们用这个类比以一种更简单的方式来重新证明M. Sipser(1984)关于可数电路的一个结果。在有限的情况下，这个类比允许我们用CLIQUE函数给出co-NP的一个新的表征。这就对CLIQUE函数的np完备性给出了一个自然的解释

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

查看原文本刊更多论文

On ultrafilters and NP

The fusion method (A. Wigderson, 1993) is developed by exploring its similarities with the ultraproduct construction in model theory. We use this analogy to re-prove a result of M. Sipser (1984) regarding countable circuits, in a simpler way. In the finite case this analogy allows us to give a new characterization of co-NP in terms of the CLIQUE function. This gives a natural interpretation to the NP-completeness of the CLIQUE function.<>

求助全文

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

来源期刊

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

自引率

0.00%

发文量