Computational complexity and feasibility of data processing and interval computations, with extension to cases when we have partial information about probabilities. Kreinovich, V. & Longpré, L. In Brattka, V., Schröder, M., Weihrauch, K., & Zhong, N., editors, Computability and Complexity in Analysis, volume 302, of Informatik Berichte, pages 19–54, August, 2003. FernUniversität in Hagen. International Conference, CCA 2003, Cincinnati, USA, August 28–30, 2003
bibtex   
@INPROCEEDINGS{KL03a,
  author = {Kreinovich, Vladik and Longpr\'{e}, Luc},
  title = {Computational complexity and feasibility of data processing and interval
	computations, with extension to cases when we have partial information
	about probabilities},
  booktitle = {Computability and Complexity in Analysis},
  year = {2003},
  editor = {Brattka, Vasco and Schr{\"{o}}der, Matthias and Weihrauch, Klaus
	and Zhong, Ning},
  volume = {302},
  series = {Informatik Berichte},
  pages = {19--54},
  month = aug,
  publisher = {FernUniversit\"at in Hagen},
  note = {International Conference, CCA 2003, Cincinnati, USA, August 28--30,
	2003},
  keywords = {bib}
}

Downloads: 0