Juntas的局部校正
Local Correction of Juntas
摘要:
一个n元布尔函数f被称为q-局部可校正的,如果给定一个函数g的黑盒访问,该函数g“接近”f的同构f_sigma,我们可以通过q次查询g以很好的概率计算出Z_2 ^n中任意x的f_sigma(x)。我们观察到任何k-junta,即任何只依赖于其输入变量k的函数,都是O(2^k)-局部可纠正的。此外,我们表明,有这样的例子,这基本上是最好的可能性,局部纠正一些k-juntas需要一些查询,这是指数在k。这些例子,但是,是远远不是典型的,事实上,我们证明,几乎每一个k-军,O(k log k)查询就足够了。
英文摘要:
A Boolean function f over n variables is said to be q-locally correctable if, given a black-box access to a function g which is "close" to an isomorphism f_sigma of f, we can compute f_sigma(x) for any x in Z_2^n with good probability using q queries to g. We observe that any k-junta, that is, any function which depends only on k of its input variables, is O(2^k)-locally correctable. Moreover, we show that there are examples where this is essentially best possible, and locally correcting some k-juntas requires a number of queries which is exponential in k. These examples, however, are far from being typical, and indeed we prove that for almost every k-junta, O(k log k) queries suffice.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。