{"title":"随机查询复杂度的多数引理","authors":"Mika Göös, Gilbert Maystre","doi":"10.4230/LIPIcs.CCC.2021.18","DOIUrl":null,"url":null,"abstract":"We show that computing the majority of n copies of a boolean function g has randomised query complexity [EQUATION]. In fact, we show that to obtain a similar result for any composed function f ο gn, it suffices to prove a sufficiently strong form of the result only in the special case g = GAPOr.","PeriodicalId":336911,"journal":{"name":"Proceedings of the 36th Computational Complexity Conference","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A majority lemma for randomised query complexity\",\"authors\":\"Mika Göös, Gilbert Maystre\",\"doi\":\"10.4230/LIPIcs.CCC.2021.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that computing the majority of n copies of a boolean function g has randomised query complexity [EQUATION]. In fact, we show that to obtain a similar result for any composed function f ο gn, it suffices to prove a sufficiently strong form of the result only in the special case g = GAPOr.\",\"PeriodicalId\":336911,\"journal\":{\"name\":\"Proceedings of the 36th Computational Complexity Conference\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 36th Computational Complexity Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/LIPIcs.CCC.2021.18\",\"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 the 36th Computational Complexity Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.CCC.2021.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We show that computing the majority of n copies of a boolean function g has randomised query complexity [EQUATION]. In fact, we show that to obtain a similar result for any composed function f ο gn, it suffices to prove a sufficiently strong form of the result only in the special case g = GAPOr.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
