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 www.ibc-research.org.
For information about the Columbia-MIT project on Continuous Quantum Computation please visit quantum.cs.columbia.edu.
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.
2010 and 2011 events: