在任意基上检查只读函数的测试
Checking Tests for Read-Once Functions over Arbitrary Bases
摘要:
一个布尔函数被称为在基B上只读一次,如果它可以用一个公式在B上表示,其中没有变量出现超过一次。对B上的只读函数f依赖于其所有变量的检查测试是将f与相同变量的所有其他只读函数区分开的一组输入向量。我们证明了B上的每个只读函数f都有一个包含O(n^l)个向量的检查测试,其中n是f的相关变量的个数,l是B中函数的最大元数。对于某些函数,这个界限不能被改进超过一个常数因子。所采用的技术涉及重建f从它的l-变量投影,并提供了一个更强的形式库兹涅佐夫的经典定理读一次表示。
英文摘要:
A Boolean function is called read-once over a basis B if it can be expressed by a formula over B where no variable appears more than once. A checking test for a read-once function f over B depending on all its variables is a set of input vectors distinguishing f from all other read-once functions of the same variables. We show that every read-once function f over B has a checking test containing O(n^l) vectors, where n is the number of relevant variables of f and l is the largest arity of functions in B. For some functions, this bound cannot be improved by more than a constant factor. The employed technique involves reconstructing f from its l-variable projections and provides a stronger form of Kuznetsov's classic theorem on read-once representations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。