1995 Reports
Strong tractability of weighted tensor products
We deal with approximating linear operators Sd that are defined as d weighted tensor products. We consider the worst case average case randomized and probabilistic settings depending on how the error of an approximation is defined.
Subjects
Files
-
cucs-021-96.pdf
application/pdf
209 KB
Download File
-
demo title for ac:110248
application/octet-stream
63.5 KB
Download File
More About This Work
- Academic Units
- Computer Science
- Publisher
- Department of Computer Science, Columbia University
- Series
- Columbia University Computer Science Technical Reports, CUCS-021-96
- Published Here
- April 25, 2011