AND Testing and Robust Judgement Aggregation

Lifshitz Noam
Lifshitz Noam
Minzer Dor
Minzer Dor

STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing Chicago IL USA June, 2020, pp. 222-233, 2019.

被引用1|引用|浏览16|DOI:https://doi.org/10.1145/3357713.3384254
EI
其它链接arxiv.org|dl.acm.org|dblp.uni-trier.de|academic.microsoft.com

摘要

A function f∶{0,1}n→ {0,1} is called an approximate AND-homomorphism if choosing x,y∈n uniformly at random, we have that f(x∧ y) = f(x)∧ f(y) with probability at least 1−ε, where x∧ y = (x1∧ y1,…,xn∧ yn). We prove that if f∶ {0,1}n → {0,1} is an approximate AND-homomorphism, then f is δ-close to either a constant function or an AND functi...更多

代码

数据

下载 PDF 全文
您的评分 :
0

 

标签
评论