A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
We study the average case complexity of a linear multivariate problem (LMP) defined on functions of d variables. We consider two classes of information. The first Astd consists of function values and the second A*11 of all continuous linear functionals. Tractability of LMP means that the average case complexity is 0((l/e)p) with p independent of d. We prove that tractability of an LMP in Astd is equivalent to tractability in A311, although the proof is not constructive. We provide a simpledoi:10.1090/s0273-0979-1993-00400-2 fatcat:2sdrieb54vbirmbplutbnyyb3e