{"title":"自约集约简为深度1加权阈值电路类和稀疏集","authors":"Manindra Agrawal, V. Arvind","doi":"10.1109/SCT.1995.514865","DOIUrl":null,"url":null,"abstract":"Let LT/sub 1/ denote the class of languages accepted by nonuniform families of polynomial size depth-1 circuits with a linear weighted threshold gate at the root. We show that disjunctive self-reducible bd-cylinders that many-one reduce to LT/sub 1/ are in P. It follows that for C/spl isin.","PeriodicalId":318382,"journal":{"name":"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Reductions of self-reducible sets to depth-1 weighted threshold circuit classes, and sparse sets\",\"authors\":\"Manindra Agrawal, V. Arvind\",\"doi\":\"10.1109/SCT.1995.514865\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let LT/sub 1/ denote the class of languages accepted by nonuniform families of polynomial size depth-1 circuits with a linear weighted threshold gate at the root. We show that disjunctive self-reducible bd-cylinders that many-one reduce to LT/sub 1/ are in P. It follows that for C/spl isin.\",\"PeriodicalId\":318382,\"journal\":{\"name\":\"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCT.1995.514865\",\"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 Structure in Complexity Theory. Tenth Annual IEEE Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1995.514865","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Reductions of self-reducible sets to depth-1 weighted threshold circuit classes, and sparse sets
Let LT/sub 1/ denote the class of languages accepted by nonuniform families of polynomial size depth-1 circuits with a linear weighted threshold gate at the root. We show that disjunctive self-reducible bd-cylinders that many-one reduce to LT/sub 1/ are in P. It follows that for C/spl isin.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
