1994 Reports
Explicit cost bounds of algorithms for multivariate tensor product problems
We study multivariate tensor product problems in the worst case and average case
settings. They are denied on functions of d variables For arbitrary d we provide
explicit upper bounds on the costs of algorithms which compute an approximation
to the solution.
Subjects
Files
-
cucs-020-96.pdf application/pdf 369 KB Download File
-
demo title for ac:110245 application/octet-stream 142 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-020-96
- Published Here
- April 25, 2011