Workshop on Information Based Complexity

Foundations of Computational Mathematics.

Hong Kong, China, June 16 - 26, 2008

General information

Worshop date and time: June 16-18, 2008

Location: City University, Hong Kong.

Organizers Klaus Ritter, Darmstadt, Germany.

Ian Sloan, Sydney, Australia.

Related links FoCM'2008 main page

FoCM main page

Abstracts List of Abstracts

Schedule See here

Slides See here

Workshop description and scope

Information-based complexity (IBC) is concerned with the complexity and algorithms for continuous problems where information is incomplete, contaminated and priced. Important examples are high dimensional integration, differential and integral equations and numerical optimization. Problems can be studied in the worst case, average case or randomised settings. The focus is on questions such as: What is the least possible cost (e.g., in terms of the number of function evaluations) to obtain approximation with given error? How does the cost change with dimensionality? What algorithms achieve the minimum cost?


Confirmed Participants

(as of July 04, 2008)

Semiplenary Speakers

Further Participants and Speakers

Related sites.

FoCM Main Homepage
Foundations of Computational Mathematics - the Journal