arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.1995cs.DM
收藏

算术只读公式的特征化

Characterizing Arithmetic Read-Once Formulae

Ilya Volkovich

摘要:

\emph{arithmetic read-once formula}(简称ROF)是一个公式(即计算树),其中运算是$\{+,\times\}$,并且每个输入变量最多标记一个叶子。我们给出了这类公式的一个简单的特征。除了有趣的是在其本身的权利,我们的表征引起的属性测试算法的功能可计算的这些公式。据我们所知,在我们的工作之前,没有已知的这种公式的表征和/或属性测试算法。

英文摘要:

An \emph{arithmetic read-once formula} (ROF for short) is a formula (i.e. a tree of computation) in which the operations are $\{+,\times\}$ and such that every input variable labels at most one leaf. We give a simple characterization of such formulae. Other than being interesting in its own right, our characterization gives rise to a property testing algorithm for functions computable by such formulae. To the best of our knowledge, prior to our work no characterization and/or property testing algorithm was known for this kind of formulae.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑