Workshop on Information Based Complexity

The workshop is part of the triennial Conference on Foundations of Computational Mathematics (FoCM'14) organized by the Society for Foundations of Computational Mathematics hosted by the Universidad de la Republica in Montevideo, Uruguay, December 15-17, 2014


Stefan Heinrich, University of Kaiserslautern, Germany
Aicke Hinrichs, Johannes Kepler University Linz, Austria
Frances Kuo, University of New South Wales, Australia

Contact the Organizers

Information-based complexity (IBC) is concerned with complexity theory 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 or arithmetic operations) to obtain approximations with given error? How does this minimal cost change with dimensionality? What algorithms achieve minimum cost?