使用Õ(n^{3/4})自适应查询进行布尔一致性测试

2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) Pub Date : 2017-10-01 DOI:10.1109/FOCS.2017.85

Xi Chen, Erik Waingarten, Jinyu Xie

{"title":"使用Õ(n^{3/4})自适应查询进行布尔一致性测试","authors":"Xi Chen, Erik Waingarten, Jinyu Xie","doi":"10.1109/FOCS.2017.85","DOIUrl":null,"url":null,"abstract":"We give an adaptive algorithm that tests whether an unknown Boolean function f: {0,1}^n -≈ {0, 1} is unate (i.e. every variable of f is either non-decreasing or non-increasing) or ≥-far from unate with one-sided error and O(n^{3/4}/≥^2) many queries. This improves on the best adaptive O(n/≥)-query algorithm from Baleshzar, Chakrabarty, Pallavoor, Raskhodnikova and Seshadhri when 1/ε","PeriodicalId":311592,"journal":{"name":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Boolean Unateness Testing with Õ(n^{3/4}) Adaptive Queries\",\"authors\":\"Xi Chen, Erik Waingarten, Jinyu Xie\",\"doi\":\"10.1109/FOCS.2017.85\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give an adaptive algorithm that tests whether an unknown Boolean function f: {0,1}^n -≈ {0, 1} is unate (i.e. every variable of f is either non-decreasing or non-increasing) or ≥-far from unate with one-sided error and O(n^{3/4}/≥^2) many queries. This improves on the best adaptive O(n/≥)-query algorithm from Baleshzar, Chakrabarty, Pallavoor, Raskhodnikova and Seshadhri when 1/ε\",\"PeriodicalId\":311592,\"journal\":{\"name\":\"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FOCS.2017.85\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FOCS.2017.85","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 13

摘要

我们给出了一个自适应算法来测试未知布尔函数f: {0,1}^n -≈{0,1}是一元的(即f的每个变量要么是非递减的要么是非递增的)或者≥-远不是一元的，有单侧误差和O(n^{3/4}/≥^2)次查询。这改进了来自Baleshzar, Chakrabarty, Pallavoor, Raskhodnikova和Seshadhri的最佳自适应O(n/≥)查询算法，当1/ε

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

查看原文

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

本刊更多论文

Boolean Unateness Testing with Õ(n^{3/4}) Adaptive Queries

We give an adaptive algorithm that tests whether an unknown Boolean function f: {0,1}^n -≈ {0, 1} is unate (i.e. every variable of f is either non-decreasing or non-increasing) or ≥-far from unate with one-sided error and O(n^{3/4}/≥^2) many queries. This improves on the best adaptive O(n/≥)-query algorithm from Baleshzar, Chakrabarty, Pallavoor, Raskhodnikova and Seshadhri when 1/ε

求助全文

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

来源期刊

2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)

自引率

0.00%

发文量

期刊最新文献

On Learning Mixtures of Well-Separated Gaussians Obfuscating Compute-and-Compare Programs under LWE Minor-Free Graphs Have Light Spanners Lockable Obfuscation How to Achieve Non-Malleability in One or Two Rounds