Year: 2014
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Author: Volkovich, Ilya
Institution: Princeton University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: National Science Foundation
OpenAlex ID: W2952758993