Feasible Mathematics A Mathematical Sciences Institute Workshop Ithaca Yor
由……售出:
CN¥549.00
有货
+ CN¥149.49 送货
14天退货政策
付款方式：
产品详情
产品详情
Feasible Mathematics A Mathematical Sciences Institute Workshop Ithaca Yor
A So-called Effective Algorithm May Require Arbitrarily Large Finite Amounts Of Time And Space Resources, And Hence May Not Be Practical In The Real World. A Feasible Algorithm Is One Which Only Requires A Amount Of Space Andor Time For Execution; The General Idea Is That A Feasible Algorithm Is One Which May Be Practical On Todays Or At Least Tomorrows Computers. There Is No Definitive Analogue Of Churchs Thesis Giving A Mathematical Definition Of Feasibility; However, The Most Widely Studied Mathematical Model Of Feasible Computability Is Polynomial-time Computability.
- 品牌: Springer Nature B.V
- 类别: 计算机与互联网
-
语言: English
-
作者: Samuel Buss
-
出版日期: 1990-01-01
-
页数: 364
-
出版社／标签: Springer Nature B.V
-
格式: Paperback
- Fruugo ID: 556935363-1125174346
- ISBN: 9780817634834
配送
送货
在 24 小时内发货
-
STANDARD: CN¥149.49 - 之间的交付 周二 10 十一月 2026–周二 08 十二月 2026
从 英国 送货。
退货
退货
我们会争取将您订购的产品按照您的规格完整地配送给您。不过，万一您收到不完整的订单，或收到的产品与您订购的不同，或者有其他原因让您对订单不满意，您可以要求全部或部分退货，您将收到相应产品的全额退款。