in Parallel Nader H. Bshouty Richard Cleve Department of Computer Science...  Home/Search
Context
Related
| pages.cpsc.ucalgary.ca...interpolate.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pages.cpsc.ucalgary.ca/~cleve/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A formula is read-once if each variable appears at most once in it. 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(n + 3n \Gamma 2), our algorithm runs in O(log ) ... (Update)
Similar documents (at the sentence level):
43.5%: Interpolating Arithmetic Read-Once Formulas - In Parallel Nader (Correct)
42.2%: Interpolating Arithmetic Read-Once Formulas in Parallel - Bshouty, Cleve (1998) (Correct)
Active bibliography (related documents): More All
0.7: On Learning Arithmetic Read-Once Formulas - With Exponentiation Daoud (Correct)
0.4: Noise-Tolerant Parallel Learning of Geometric Concepts - Bshouty, Goldman, Mathias (1995) (Correct)
0.2: The Query Complexity of Finding Local Minima in the Lattice - Beimel, Geller, al. (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ nader-interpolating,
author = "In Parallel Nader",
title = "Interpolating Arithmetic Read-Once Formulas",
url = "citeseer.ist.psu.edu/762151.html" }
Citations (may not include all citations):493 Communications of the ACM (context) - Valiant, of et al. - 1984
441 Queries and concept learning (context) - Angluin - 1987
317 Learning Quickly When Irrelevant Attributes Abound: A New Li.. (context) - Littlestone - 1988
201 Parallel prefix computation (context) - Ladner, Fischer - 1980
174 The parallel evaluation of general arithmetic expressions (context) - Brent - 1974
97 Learning Read-Once Formulas with Queries - Angluin, Hellerstein et al. - 1993
82 When Won't Membership Queries Help (context) - Angluin, Kharitonov - 1995
35 Fast parallel algorithms for sparse multivariate polynomial .. (context) - Grigoriev, Karpinski et al. - 1990
26 Learning arithmetic read-once formulas (context) - Bshouty, Hancock et al. - 1995
23 Interpolation and approximation of sparse multivariate polyn.. (context) - Roth, Benedek - 1991
20 Learning sparse multivariate polynomials over a field with q.. - Schapire, Sellie - 1993
19 the complexity of learning from counterexamples and membersh.. (context) - Maass, Tur'an - 1990
18 Interpolation of sparse rational functions without knowing b.. (context) - Grigoriev, Karpinski et al. - 1990
18 the Decidability of Sparse Univariate Polynomial Interpolati.. (context) - Borodin, Tiwari - 1991
17 Learning boolean read-once formulas with arbitrary symmetric.. (context) - Bshouty, Hancock et al.
17 the exact learning of formulas in parallel (context) - Bshouty, Cleve - 1992
15 Asking Questions to Minimize Errors - Bshouty, Goldman et al. - 1993
13 An Algorithm to Learn Read-Once Threshold Formulas - Bshouty, Hancock et al. - 1994
13 Exact Identification of Read-Once Formulas Using Fixed Point.. - Goldman, Kearns et al. - 1993
12 Learning read-once formulas over fields and extended bases (context) - Hancock, Hellerstein - 1991
11 A deterministic algorithm for sparse multivariate polynomial.. (context) - Ben-Or, Tiwari - 1988
8 Identifying -formula decision trees with queries (context) - Hancock - 1990
7 Randomized approximation and interpolation of sparse polynom.. (context) - Mansour - 1995
6 Testing polynomials that are easy to compute (context) - Heintz, Schnorr - 1980
6 Fast polynomial algorithms for verification of polynomial id.. (context) - Schwartz - 1980
3 Information and Computation (context) - Vitter, Lin et al. - 1992
Documents on the same site (http://pages.cpsc.ucalgary.ca/~cleve/pubs/): More
The query complexity of order-finding - Richard Cleve Department (Correct)
quant-ph/9802049 - Sep Quantum Lower (Correct)
Fast parallel circuits for the quantum Fourier transform - Richard Cleve John (Correct)
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