A formula is read-once if each variable appears on at most a single input. Angluin, Hellerstein, and Karpinski have shown that boolean formulas with AND, OR, and NOT gates are exactly identifiable in polynomial time using membership and equivalence queries [AHK89]. Hancock and Hellerstein have generalized this to allow a wider subclass of symmetric basis functions [HH91]. We show a polynomial time algorithm in this model for identifying read-once formulas whose gates compute arbitrary functions of fan-in
如果每个变量最多出现在单个输入上,则该公式为只读一次。 Angluin,Hellerstein和Karpinski已经证明,使用隶属关系和对等查询[AHK89]可以在多项式时间内准确地识别具有AND,OR和NOT门的布尔公式。 Hancock和Hellerstein已对此进行了概括,以允许使用更广泛的对称基函数子类[HH91]。我们在该模型中展示了一个多项式时间算法,用于识别一次公式,这些公式的门为某个常数
Department of Computer Science, The University of Calgary, 2500 University Drive N.W., Calgary, Alberta, Canada T2N 1N4;
Aiken Computation Laboratory, Harvard University, 33 Oxford Street, Cambridge, MA;
Department of EECS, Northwestern University, 2145 Sheridan Road, Evanston, IL;
机译:计算对称布尔函数的逻辑电路的能量和扇入
机译:具有少量任意对称门的恒定深度电路的伪随机位
机译:关于扇形栅极扇形围栏界深度电路和公式的复杂性
机译:具有少量任意对称门的恒定深度电路的伪随机位
机译:具有无限扇入门的恒定深度布尔电路的可满足性算法。
机译:功能隔离的神经基质用于任意视听配对协会学习
机译:在广义基础上学习布尔一次读取公式