关于PF (omicron)哈希P的闭包性质

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

M. Ogihara, T. Thierauf, Seinosuke Toda, O. Watanabe

{"title":"关于PF (omicron)哈希P的闭包性质","authors":"M. Ogihara, T. Thierauf, Seinosuke Toda, O. Watanabe","doi":"10.1109/SCT.1993.336532","DOIUrl":null,"url":null,"abstract":"It is shown that while absolute answers to open questions about relationships between counting classes seem hard to get, it is still possible to obtain relative answers that help us to develop intuition about or understanding of these relationships. In particular, a structural approach to extending such understanding is proposed.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On closure properties of Hash P in the context of PF (omicron) Hash P\",\"authors\":\"M. Ogihara, T. Thierauf, Seinosuke Toda, O. Watanabe\",\"doi\":\"10.1109/SCT.1993.336532\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is shown that while absolute answers to open questions about relationships between counting classes seem hard to get, it is still possible to obtain relative answers that help us to develop intuition about or understanding of these relationships. In particular, a structural approach to extending such understanding is proposed.<<ETX>>\",\"PeriodicalId\":331616,\"journal\":{\"name\":\"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"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.336532\",\"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.336532","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

这表明，虽然关于计数类之间关系的开放问题的绝对答案似乎很难得到，但仍然有可能获得相对的答案，帮助我们发展对这些关系的直觉或理解。特别地，提出了一种扩展这种理解的结构性方法。

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

查看原文本刊更多论文

On closure properties of Hash P in the context of PF (omicron) Hash P

It is shown that while absolute answers to open questions about relationships between counting classes seem hard to get, it is still possible to obtain relative answers that help us to develop intuition about or understanding of these relationships. In particular, a structural approach to extending such understanding is proposed.<>

求助全文

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

来源期刊

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

自引率

0.00%

发文量