A formula is read-once if each variable appears at most once in it. An arithmetic read-once formula is one in which the operators are addition, subtraction, multiplication, and division. We present polynomial time algorithm for exactly learning (or interpolating) arithmetic read-once formulas computing functions over a field. We present an algorithm that uses randomized membership queries (or substitutions) to identify such formulas over large finite fields and infinite fields. We also present a deterministic algorithm that uses equivalence queries as well as membership queries to identify arithmetic read-once formulas over small finite fields. We then non-constructively show the existence of deterministic membership query (interpolation) algorithms for arbitrary formulas over fields of characteristic 0 and for division-free formulas over large or infinite fields. Our algorithms assume we are able to efficiently perform arithmetic operations on field elements and compute square roots in the field. It is shown that the ability to compute square roots is necessary, in the sense that the problem of computing
如果每个变量最多出现一次,则该公式为只读一次。算术一次读取公式是一种运算符,其中的运算符为加,减,乘和除。我们提出了多项式时间算法,用于在某个字段上精确学习(或内插)算术一次计算公式。我们提出一种算法,该算法使用随机成员资格查询(或替代)来识别大型有限域和无限域上的此类公式。我们还提出了一种确定性算法,该算法使用对等查询以及成员身份查询来识别较小有限字段上的算术一次读取公式。然后,我们以非建设性的方式显示了确定性隶属查询(插值)算法的存在,该算法用于特征0字段上的任意公式以及大或无限字段上的无除法公式。我们的算法假设我们能够有效地对字段元素执行算术运算并计算字段中的平方根。结果表明,必须具有计算平方根的能力,从某种意义上说,可以将在字段中计算
机译:学习算术一次性配方
机译:内插算术一次读取公式并行
机译:一次性遗忘算术分支程序总和的确定性身份测试
机译:关于带幂运算的一次算术公式的学习(扩展摘要)
机译:算术组和稳定痕量公式的同学的生长
机译:在蜜蜂中进行算术学习并检查个人如何学习
机译:学习算术一次性配方*