QUERY COMPLEXITY

查询的复杂性

人工智能

售   价:
716.00
发货周期:预计3-5周发货
作      者
出  版 社
出版时间
装      帧
精装
ISBN
9789813223202
复制
页      码
200
语      种
英语
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
Query complexity addresses issues like the number of calls to a black box routine, the number of queries to a data structure or the number of steps made by a parallel processor. It has immense applications, and not surprisingly a large number of papers have been written on it. Yet, currently there is no book that is entirely devoted to this subject. We fill this gap, and gather not only many valuable articles into a single book, but also organize knowledge, explain some key results, and give presentable outlines. The work we do for the reader saves valuable time and also points to connections for those who are just getting familiar with the area.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个