The parallel complexity of function approximation

✍ Scribed by Jörg-Detlef Kern

• Publisher: Elsevier Science
• Year: 1991
• Tongue: English
• Weight: 679 KB
• Volume: 7
• Category: Article
• ISSN: 0885-064X
• DOI: 10.1016/0885-064x(91)90005-i

✦ Synopsis

We introduce a parallel model of computation over the reals. We then obtain lower and upper bounds on the parallel complexity of approximating certain types of smooth functions in n dimensions. The bounds are obtained for both unbounded and bounded parallelism.

o IW Academic PRSS, IIIC.