Academic Commons

Reports

Computational complexity of continuous problems

Wozniakowski, Henryk

Computational complexity studies the intrinsic difficulty of solving mathematically posed problems. Information based complexity is a branch of computational complexity that deals with continuous problems defined on spaces of multivariate functions. For such problems only approximate solutions are possible to compute. The complexity is defined as the minimal cost needed to compute an approximation with error at most. Error and cost can be defined in different settings such as the worst case average case probabilistic or randomized settings.

Subjects

Files

  • thumnail for demo title for ac:110262 demo title for ac:110262 application/octet-stream 55 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-025-96
Published Here
April 25, 2011
Academic Commons provides global access to research and scholarship produced at Columbia University, Barnard College, Teachers College, Union Theological Seminary and Jewish Theological Seminary. Academic Commons is managed by the Columbia University Libraries.