On XOR Lemma for Polynomial Threshold Weight and Length
On XOR Lemma for Polynomial Threshold Weight and Length
复制标题
关于多项式阈值权重和长度的异或引理
DOI:
10.1007/978-3-319-30000-9_20
复制
发表时间:
2016
期刊:
影响因子:
--
通讯作者:
Kazuyuki Amano
中科院分区:
文献类型:
--
作者:
Masaki Nakanishi;Miki Matsuyama;and Yumi Yokoo;Kazuyuki Amano
Letbe a Boolean function. We say that a multilinear polynomialpsign-representsfiffor all. In this paper, we consider the length and weight of polynomials sign-representing Boolean functions of the formwhere eachfis on a disjoint set of variables. Obviously, ifpsign-representsf, thenp(x)p(y) sign-represents. We give a constructive proof that there is a shorter polynomial whenfis AND onnvariables for every. In addition, we introduce a parameterof a Boolean function and show that thek-th root of the minimum weight of a polynomial sign-representing(ktimes) converges betweenandaskgoes to infinity.