Information-based complexity (IBC) is the branch of computational complexity which studies problems for which the information is partial, contaminated, and priced.

For detailed information about the problems studied in IBC, the people working in the field, and their publications please visit

For information about the Columbia-MIT project on Continuous Quantum Computation please visit

2002 Dagstuhl Seminar Algorithms and Complexity for Continuous Problems: Photos by Shu Tezuka.

MCQMC 2004 in Juan-les-Pins, Côte d'Azur, France, and MCM 2004 in Bedlewo, Poland: Photos by Shu Tezuka.

2007 events:

  • Complexity of Multivariate Problems,
    as part of the First Joint AMS-PTM Meeting in Warsaw,
    July 31 - August 3, 2007
  • COE Conference on the Development of Dynamic Mathematics with High Functionality (DMHF 2007)
    21st Century COE(Center Of Excellence) Program, Kyushu University, Fukuoka, Japan
    October 1 - 4, 2007

2010 and 2011 events:


MCQMC 2010
Ninth International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing
Warsaw, Poland
Aug 15 - 20, 2010

ICIAM 2011

ICIAM 2011
International Congress on Industrial and Applied Mathematics
Vancouver, Canada
Jul 18 - 22, 2011