Algorithmics for Hard Problems

通信技术

原   价:
720
售   价:
576.00
优惠
平台大促 低至8折优惠
作      者
出  版 社
出版时间
2010年12月08日
装      帧
平装
ISBN
9783642079092
复制
页      码
544
语      种
英语
版      次
2
综合评分
暂无评分
我 要 买
- +
库存 91 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介

There are several approaches to attack hard problems. All have their merits, but also their limitations, and need a large body of theory as their basis. A number of books for each one exist: books on complexity theory, others on approximation algorithms, heuristic approaches, parametrized complexity, and yet others on randomized algorithms. This book discusses thoroughly all of the above approaches. And, amazingly, at the same time, does this in a style that makes the book accessible not only to theoreticians, but also to the n

本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个