Computational Complexity and Feasibility of Data Processing and Interval Computations

数学史

售   价:
1768.00
出  版 社
出版时间
1997年12月31日
装      帧
精装
ISBN
9780792348658
复制
页      码
472
语      种
英语
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
The input data for data processing algorithms come from measurements and are hence not precise. We therefore need to estimate the accuracy of the results of data processing. It turns out that even for the simplest data processing algorithms, this problem is, in general, intractable. This book describes for what classes of problems interval computations (i.e. data processing with automatic results verification) are feasible, and when they are intractable. This knowledge is important, e.g. for algorithm developers, because it will e
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个