Abstract

A problem is considered in which it is required that a Boolean function \(g\) of \(n\) variables be specified such that for any function that essentially depends on exactly \(n-1\) variables it is possible to present a certain number of tuples of a given function so that this function \(g\) is the only one that coincides with the given function on these tuples. It is shown that the sum modulo two of \(n\) variables is the required function.

中文翻译：

---

关于线性布尔函数的一个性质

摘要

的问题被认为是在其被要求布尔函数\（克\）的\（N \）变量指定，使得对于该基本上取决于确切的任何函数\（N-1 \）的变量有可能存在给定函数的一定数量的元组，因此该函数\(g\)是唯一一个与这些元组上的给定函数重合的函数。结果表明，\(n\)变量的模二之和就是所需的函数。