Tabla de Contenidos:
  • Complexity and Real Computation; Copyright; Foreword; Preface; Contents; Part I 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?""; Part II Some Geometry of Numerical Algorithms; 8 Newton's Method; 9 Fundamental Theorem of Algebra: Complexity Aspects; 10 Bézout's Theorem; 11 Condition Numbers and the Loss of Precision of Linear Equations.
  • 12 The Condition Number for Nonlinear Problems13 The Condition Number in P(H(d)); 14 Complexity and the Condition Number; 15 Linear Programming; Part III 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.