# Interpolating Arithmetic Read-Once Formulas in Parallel

@article{Bshouty1998InterpolatingAR,
title={Interpolating Arithmetic Read-Once Formulas in Parallel},
author={Nader H. Bshouty and Richard Cleve},
journal={SIAM J. Comput.},
year={1998},
volume={27},
pages={401-413}
}
• Published 1 April 1998
• Computer Science, Mathematics
• SIAM J. Comput.
A formula is read-once if each variable appears in it at most once. An arithmetic formula is one in which the operations are addition, subtraction, multiplication, and division (and constants are allowed). We present a randomized (Las Vegas) parallel algorithm for the exact interpolation of arithmetic read-once formulas over sufficiently large fields. More specifically, for $n$-variable read-once formulas and fields of size at least 3(n2+3n-2), our algorithm runs in $O(\log^2 n)$ parallel steps…

• Computer Science, Mathematics
computational complexity
• 2015
The main technique is to prove a hardness of representation result, namely a theorem showing a relatively mild lower bound on the sum of k PROFs, which is used in order to design the PIT algorithm.

### Isomorphism testing of read-once functions and polynomials

• Mathematics, Computer Science
FSTTCS
• 2011
A deterministic polynomial time canonization scheme for polynomials computed by read-once arithmetic formulas is proposed, and it is shown that when the arithmetic formula is allowed to read a variable twice, this problem is as hard as the graph isomorphism problem.

### Interpolation of depth-3 arithmetic circuits with two multiplication gates

The proof technique is new and relies on the factorization algorithm for multivariate black-box polynomials, on lower bounds on the length of linear locally decodable codes with 2 queries, and on a theorem regarding the structure of identically zero depth-3 circuits with four multiplication gates.

### Random arithmetic formulas can be reconstructed efficiently

• Computer Science, Mathematics
2013 IEEE Conference on Computational Complexity
• 2013
A randomized algorithm that given black-box access to the polynomial f computed by an unknown/hidden arithmetic formula ϕ reconstructs, on the average, an equivalent or smaller formula that computes an ANF formula of size s computing f.

### On Some Computations on Sparse Polynomials

The question of efficiently evaluating a polynomial given an oracle access to its power is studied and it is shown that a reconstruction algorithm for a circuit class C can be extended to handle f for f ∈ C, and an efficient deterministic algorithm for factoring sparse multiquadratic1 polynomials is found.

### Random Arithmetic Formulas can be Reconstructed Efficiently Full Version

• Computer Science, Mathematics
• 2012
A randomized algorithm that given blackbox access to the polynomial f computed by an unknown/hidden arithmetic formula φ reconstructs, on the average, an equivalent or smaller formulaπ̂ in time polynomials in the size of its output φ̂.

This work gives a simple characterization of an arithmetic Read-Once Formula in which the operations are { +, ×} and such that every input variable labels at most one leaf.

### Sums of Read-Once Formulas: How Many Summands Suffice?

• Mathematics, Computer Science
CSR
• 2015
This work proves, for certain multilinear polynomials, a tight lower bound on the number of summands in such an expression.

### Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas

• Mathematics, Computer Science
Electron. Colloquium Comput. Complex.
• 2016
The first polynomial-time deterministic identity testing algorithm that operates in the black-box setting for ROFs, as well as some other related models, are obtained.

## References

SHOWING 1-10 OF 28 REFERENCES

• Mathematics, Computer Science
STOC '92
• 1992
An algorithm for exactly learning (or interpolating) arithmetic read-once formulas computing functions over a field and an algorithm that uses randomized membership queries (or substitutions) to identify such formulas over large finite fields and infinite fields are presented.

### Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields

• Computer Science
SIAM J. Comput.
• 1990

### The Parallel Evaluation of General Arithmetic Expressions

It is shown that arithmetic expressions with n ≥ 1 variables and constants; operations of addition, multiplication, and division; and any depth of parenthesis nesting can be evaluated in time 4 log 2 + 10(n - 1) using processors which can independently perform arithmetic operations in unit time.

### Learning sparse multivariate polynomials over a field with queries and counterexamples

• Computer Science, Mathematics
COLT '93
• 1993
We consider the problem of learning a polynomial over an arbitrary fieldFdefined on a set of boolean variables. We present the first provably effective algorithm for exactly identifying such

### When won't membership queries help?

• Computer Science, Mathematics
STOC '91
• 1991
We investigate cryptographic limitations on the power of membership queries to help with concept learning. We extend the notion of prediction-preserving reductions to prediction with membership

### Interpolation of sparse rational functions without knowing bounds on exponents

• Computer Science
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
• 1990
The authors present the first algorithm for the (black box) interpolation of t-sparse, n-variate, rational functions without knowing bounds on exponents of their sparse representation, with the