{"title":"计算函数与并行查询NP","authors":"Birgit Jenner, J. Torán","doi":"10.1109/SCT.1993.336519","DOIUrl":null,"url":null,"abstract":"The characterizations of the class Theta /sub 2//sup p/ of languages polynomial-time truth-table reducible to sets in NP are surveyed studying the classes obtained when the characterizations are used to define functions instead of languages. It is shown that in this way three function classes are obtained. An overview of the known relationships between these classes, including some original results, is given.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"60","resultStr":"{\"title\":\"Computing functions with parallel queries to NP\",\"authors\":\"Birgit Jenner, J. Torán\",\"doi\":\"10.1109/SCT.1993.336519\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The characterizations of the class Theta /sub 2//sup p/ of languages polynomial-time truth-table reducible to sets in NP are surveyed studying the classes obtained when the characterizations are used to define functions instead of languages. It is shown that in this way three function classes are obtained. An overview of the known relationships between these classes, including some original results, is given.<<ETX>>\",\"PeriodicalId\":331616,\"journal\":{\"name\":\"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"60\",\"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.336519\",\"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.336519","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The characterizations of the class Theta /sub 2//sup p/ of languages polynomial-time truth-table reducible to sets in NP are surveyed studying the classes obtained when the characterizations are used to define functions instead of languages. It is shown that in this way three function classes are obtained. An overview of the known relationships between these classes, including some original results, is given.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
