Y. MANSOUR, Randomized approximation and interpolation of sparse polynomials, SIAM J. Comput., 24 (1995), pp. 357--368. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Interpolating Arithmetic Read-Once Formulas in Parallel - Bshouty, Cleve (Correct)
....the value of the function at a. There are a number of classes of arithmetic formulas that can be interpolated sequentially in polynomial time as well as in parallel in poly logarithmic time (with polynomially many processors) These include sparse polynomials and sparse rational functions ([BT88,BT90,GKS90,GrKS88,RB89,M91]) Research supported in part by NSERC of Canada. Author s E mail addresses: bshouty cpsc.ucalgary.ca and cleve cpsc.ucalgary.ca. A formula over a variable set V is read once if each variable appears at most once in it. An arithmetic read once formula over a field K is a read once formula over ....
Y. Mansour. Randomized approximation and interpolation of sparse polynomials. To appear in SIAM Journal on Computing.
On Learning Arithmetic Read-Once Formulas - With Exponentiation Daoud (Correct)
....the value of the function at a. In [3] Bshouty, Hancock and Hellerstein gave a polynomial time algorithm for interpolating arithmetic read once formula. Other arithmetic classes that can be interpolated in polynomial time are the classes of sparse polynomials and sparse rational functions. [1,2,4,5,7,8,10]. This work is a nontrivial generalization of the algorithm of Bshouty, Hancock and Hellerstein for polynomial time interpolating arithmetic read once formulas over the basis of addition, subtraction, multiplication and division. An arithmetic read once formula with exponentiation is a read once ....
Y. Mansour. Randomized approximation and interpolation of sparse polynomials. To appear in SIAM Journal on Computing.
Interpolating Arithmetic Read-Once Formulas in Parallel - Bshouty, Cleve (1998) (Correct)
....returns the value of the function at a. There are a number of classes of arithmetic formulas that can be interpolated sequentially in polynomial time as well as in parallel in polylogarithmic time (with polynomially many processors) These include sparse polynomials and sparse rational functions ([BT88, BT90, GKS90b, GrKS88, RB89, GKS90b, SS93, M91]) A formula over a variable set V is read once if each variable appears at most once in it. An arithmetic read once formula over a field K is a read once formula over the basic operations of the field K; addition, subtraction, multiplication, division, and constants are also permitted in the ....
Y. MANSOUR, Randomized approximation and interpolation of sparse polynomials, SIAM J. Comput., 24 (1995), pp. 357--368.
Interpolating Arithmetic Read-Once Formulas in Parallel - Bshouty, Cleve (Correct)
....the value of the function at a. There are a number of classes of arithmetic formulas that can be interpolated sequentially in polynomial time as well as in parallel in poly logarithmic time (with polynomially many processors) These include sparse polynomials and sparse rational functions ([BT88,BT90,GKS90,GrKS88,RB89,M91]) Research supported in part by NSERC of Canada. Author s E mail addresses: bshouty cpsc.ucalgary.ca and cleve cpsc.ucalgary.ca. A formula over a variable set V is read once if each variable appears at most once in it. An arithmetic read once formula over a field K is a read once formula ....
Y. Mansour. Randomized approximation and interpolation of sparse polynomials. To appear in SIAM Journal on Computing. SIAM Journal on Computing, 24, 1995.
Interpolating Arithmetic Read-Once Formulas - In Parallel Nader (Correct)
No context found.
Y. MANSOUR, Randomized approximation and interpolation of sparse polynomials, SIAM J. Comput., 24 (1995), pp. 357--368.
Interpolating Arithmetic Read-Once Formulas - In Parallel Nader (Correct)
No context found.
Y. Mansour. Randomized approximation and interpolation of sparse polynomials. To appear in SIAM Journal on Computing. SIAM Journal on Computing, 24, 1995.
Learning Polynomials With Queries: The Highly Noisy Case - Goldreich, Rubinfeld, Sudan (1995) (22 citations) (Correct)
No context found.
Y. Mansour. Randomized approximation and interpolation of sparse polynomials. SIAM Journal on Computing, 24 (1995), 357--368.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC