网上购物 货比三家
女用仿真 戏曲 惠氏 复印机 牛仔裤 等离子电视 明治 国产表店 数码伴侣 男根套环 充气娃娃 女鞋 电影/戏剧 电池/充电器 扫描仪/扫描枪 液晶电视

全部商品分类

热搜：
保湿加湿器诺基亚
您现在的位置：快乐比价网 > 图书 > 教育/科技 > 科学与研究 > 商品详情

Complexity and real computation复杂和实计算

分享到：
Complexity and real computation复杂和实计算

最 低 价：￥748.80

定 价：￥832.00

作 者：LenoreBlum, FelipeCucker, MichaelShub, SteveSmale　著 著

出 版 社：

出版时间：1997-10-1

I S B N：9780387982816

  • 价格比较
  • 商品详情
  • 商品评论(0条)

    • 商品详情

    编辑推荐

    内容简介
    The classical theory of computation has its origins in the work of Goedel, Turing, Church, and Kleene and has been an extraordinarily successful framework for theoretical computer science. The thesis of this book, however, is that it provides an inadequate foundation for modern scientific computation where most of the algorithms are real number algorithms. The goal of this book is to develop a formal theory of computation which integrates major themes of the classical theory and which is more directly applicable to problems in mathematics, numerical analysis, and scientific computing. Along the way, the authors consider such fundamental problems as: * Is the Mandelbrot set decidable? * For simple quadratic maps, is the Julia set a halting set? * What is the real complexity of Newton's method? * Is there an algorithm for deciding the knapsack problem in a ploynomial number of steps? * Is the Hilbert Nullstellensatz intractable? * Is the problem of locating a real zero of a degree four polynomial intractable? * Is linear programming tractable over the reals? The book is divided into three parts: The first part provides an extensive introduction and then proves the fundamental NP-completeness theorems of Cook-Karp and their extensions to more general number fields as the real and complex numbers. The later parts of the book develop a formal theory of computation which integrates major themes of the classical theory and which is more directly applicable to problems in mathematics, numerical analysis, and scientific computing.

    作者简介

    目录
    Foreword
    Preface
    ⅠBasic Development
    　1 Introduction
    　2 Definitions and First Properties of Computation
    　3 Computation over a Ring
    　4 Decision Problems and Complexity over a Ring
    　5 The Class NP and NP-Complete Problems
    　6 Integer Machines
    　7 Algebraic Settings for the Problem "P≠ NP?"
    　Appendix A
    Ⅱ Some Geometry of Numerical Algorithms
    　8 Newton's Method
    　9 Fundamental Theorem of Algebra: Complexity Aspects
    　10 Bezout's Theorem
    　11 Condition Numbers and the Loss of Precision of Linear Equations
    　12 The Condition Number for Nonlinear Problems
    　13 The Condition Number in P（H（d））
    　14 Complexity and the Condition Number
    　15 Linear Programming
    　Appendix B
    Ⅲ Complexity Classes over the Reals
    　16 Deterministic Lower Bounds
    　17 Probabilistic Machines
    　18 Parallel Computations
    　19 Some Separations of Complexity Classes
    　20 Weak Machines
    　21 Additive Machines
    　22 Nonuniform Complexity Classes
    　23 Descriptive Complexity
    References
    Index

    商品评论（0条）

    暂无评论！

    相关新品推荐

    浏览更多同类商品

    您的浏览历史

    loading 内容加载中，请稍后...
    免责声明:

    本网站为购物搜索引擎,只提供各网站商品及服务信息链接,以商家实际信息为准!

    关于比价网 | 合作网站 | 免责声明 | 联系我们 (京ICP备13007221号-2)
    © 2008-2012 Bijia123.cn. All rights reserved.