Theory Of Semi-feasible Algorithms
由……售出:
CN¥1,099.00
有货
+ CN¥149.49 送货
14天退货政策
付款方式：
产品详情
产品详情
Theory Of Semi-feasible Algorithms
The Primary Goal Of This Book Is Unifying And Making More Widely Accessible The Vibrant Stream Of Research - Spanning More Than Two Decades - On The Theory Of Semi-feasible Algorithms. In Doing So It Demonstrates The Richness Inherent In Central Notions Of Complexity: Running Time, Nonuniform Complexity, Lowness, And Np-hardness. The Book Requires Neither Great Mathematical Maturity Nor An Extensive Background In Computational Complexity Theory Or In Computer Science.
- 品牌: Springer Nature B.V
- 类别: 计算机与互联网
-
语言: English
-
作者: Lane Hemaspaandra
-
出版日期: 2010-12-09
-
页数: 160
-
出版社／标签: Springer Nature B.V
-
格式: Paperback
- Fruugo ID: 557244266-1125514076
- ISBN: 9783642075810
配送
送货
在 24 小时内发货
-
STANDARD: CN¥149.49 - 之间的交付 周五 13 十一月 2026–周五 11 十二月 2026
从 英国 送货。
退货
退货
我们会争取将您订购的产品按照您的规格完整地配送给您。不过，万一您收到不完整的订单，或收到的产品与您订购的不同，或者有其他原因让您对订单不满意，您可以要求全部或部分退货，您将收到相应产品的全额退款。