On Monotonicity Testing and Boolean Isoperimetric type Theorems.

Electronic Colloquium on Computational Complexity (ECCC)(2018)

引用 89|浏览100
暂无评分
摘要
We show a directed and robust analogue of a boolean isoperimetric type theorem of Talagrand. As an application, we give a monotonicity testing algorithm that makes, up to polylog factors, (square root of n)/ε2 non-adaptive queries to a function f:0, 1n -> 0, 1, always accepts a monotone function and rejects a function that is ε-far from being monotone with constant probability.
更多
查看译文
关键词
hypercubes,color,computer science,boolean functions,testing,robustness
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要