S/sub 2/ ZPP/sup NP/

Proceedings 2001 IEEE International Conference on Cluster Computing Pub Date : 2001-10-08 DOI:10.1109/SFCS.2001.959938

Jin-Yi Cai

{"title":"S/sub 2/ ZPP/sup NP/","authors":"Jin-Yi Cai","doi":"10.1109/SFCS.2001.959938","DOIUrl":null,"url":null,"abstract":"We show that the class Sp2 is a subclass of ZPP . The proof uses universal hashing, approximate counting and witness sampling. As a consequence, a collapse first noticed by Samik Sengupta that the assumption NP has small circuits collapses PH to Sp2 becomes the strongest version to date of the Karp-Lipton Theorem. We also discuss the problem of finding irrefutable proofs for Sp2 in ZPP .","PeriodicalId":378126,"journal":{"name":"Proceedings 2001 IEEE International Conference on Cluster Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"S/sub 2/ ZPP/sup NP/\",\"authors\":\"Jin-Yi Cai\",\"doi\":\"10.1109/SFCS.2001.959938\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that the class Sp2 is a subclass of ZPP . The proof uses universal hashing, approximate counting and witness sampling. As a consequence, a collapse first noticed by Samik Sengupta that the assumption NP has small circuits collapses PH to Sp2 becomes the strongest version to date of the Karp-Lipton Theorem. We also discuss the problem of finding irrefutable proofs for Sp2 in ZPP .\",\"PeriodicalId\":378126,\"journal\":{\"name\":\"Proceedings 2001 IEEE International Conference on Cluster Computing\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2001 IEEE International Conference on Cluster Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.2001.959938\",\"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 2001 IEEE International Conference on Cluster Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.2001.959938","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

证明了类Sp2是ZPP的一个子类。该证明使用了通用哈希、近似计数和见证抽样。因此，Samik Sengupta首先注意到的一个坍缩，即假设NP有小电路将PH坍缩到Sp2，成为迄今为止卡普-利普顿定理的最强版本。我们还讨论了在ZPP中寻找Sp2的无可辩驳证明的问题。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

S/sub 2/ ZPP/sup NP/

We show that the class Sp2 is a subclass of ZPP . The proof uses universal hashing, approximate counting and witness sampling. As a consequence, a collapse first noticed by Samik Sengupta that the assumption NP has small circuits collapses PH to Sp2 becomes the strongest version to date of the Karp-Lipton Theorem. We also discuss the problem of finding irrefutable proofs for Sp2 in ZPP .

求助全文

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

来源期刊

Proceedings 2001 IEEE International Conference on Cluster Computing

自引率

0.00%

发文量

期刊最新文献

The complexity of factors of multivariate polynomials A replacement for Voronoi diagrams of near linear size "Planar" tautologies hard for resolution Traveling with a Pez dispenser (or, routing issues in MPLS) Almost tight upper bounds for vertical decompositions in four dimensions