arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1403.0417cs.CC
收藏

两种非线性测度计算的复杂性

On the Complexity of Computing Two Nonlinearity Measures

Magnus Gausdal Find

摘要:

研究了布尔非线性测度的两种计算复杂性:非线性度和乘性复杂度。我们表明,如果单向函数存在,没有算法可以计算乘法复杂度在时间$2^{O(n)}$给定的真值表的长度$2^n$,事实上,在相同的假设下,它是不可能的近似乘法复杂度内的一个因素$(2-ε)^{n/2}$。当给定一个电路时,确定乘法复杂度的问题是在多项式层次的第二层。对于非线性,我们表明,它是P很难计算给定的电路表示的函数。

英文摘要:

We study the computational complexity of two Boolean nonlinearity measures: the nonlinearity and the multiplicative complexity. We show that if one-way functions exist, no algorithm can compute the multiplicative complexity in time $2^{O(n)}$ given the truth table of length $2^n$, in fact under the same assumption it is impossible to approximate the multiplicative complexity within a factor of $(2-ε)^{n/2}$. When given a circuit, the problem of determining the multiplicative complexity is in the second level of the polynomial hierarchy. For nonlinearity, we show that it is #P hard to compute given a function represented by a circuit.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑