|
|
Sold Out
Book Categories |
| Foreword | ||
| Preface | ||
| I | Basic Development | |
| 1 | Introduction | 3 |
| 2 | Definitions and First Properties of Computation | 37 |
| 3 | Computation over a Ring | 69 |
| 4 | Decision Problems and Complexity over a Ring | 83 |
| 5 | The Class NP and NP-Complete Problems | 99 |
| 6 | Integer Machines | 113 |
| 7 | Algebraic Settings for the Problem [actual symbol not reproducible] | 125 |
| App. A.1 | Basic Notions of Algebraic Geometry | 147 |
| App. A.2 | Additional Comments and Bibliographical Remarks | 149 |
| II | Some Geometry of Numerical Algorithms | |
| 8 | Newton's Method | 153 |
| 9 | Fundamental Theorem of Algebra: Complexity Aspects | 169 |
| 10 | Bezout's Theorem | 187 |
| 11 | Condition Numbers and the Loss of Precision of Linear Equations | 201 |
| 12 | The Condition Number for Nonlinear Problems | 217 |
| 13 | The Condition Number in P(H[subscript (d)]) | 237 |
| 14 | Complexity and the Condition Number | 261 |
| 15 | Linear Programming | 275 |
| App. B.1 | The Main Theorem of Elimination Theory | 297 |
| App. B.2 | Additional Comments and Bibliographical Remarks | 299 |
| III | Complexity Classes over the Reals | |
| 16 | Deterministic Lower Bounds | 303 |
| 17 | Probabilistic Machines | 317 |
| 18 | Parallel Computations | 335 |
| 19 | Some Separations of Complexity Classes | 359 |
| 20 | Weak Machines | 377 |
| 21 | Additive Machines | 385 |
| 22 | Nonuniform Complexity Classes | 401 |
| 23 | Descriptive Complexity | 411 |
| References | 431 | |
| Index | 447 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Joseph Summerlin
reviewed Complexity and Real Computation on January 26, 2009
Complexity and Real Computation
I read this on the advice of Dr. Eiselt, Dean (at that time) of the College of Computing, after asking him via email "alright, I'm taking classes and whatnot, but I want the Stygian deep; I want to go down as far as I can; I want and need to read those books which have shaped the great computer scientists before me, the real thing." Having probed the shelves of computer science and mathematics since, I remain convinced he could have given no better advice to a precocious freshman. Used for several decades at MIT, this second edition is more than thorough enough for an introduction to computer science anywhere. Taught using the Scheme system (with its close bindings to the type-free λ-calculus), this canonical work covers register machines, logic programming, nondeterministic evaluation, the relations of recursion to iteration, and a wealth of carefully-woven-in jewels from number theory and discrete mathematics. Every programmer thinking himself the real deal owes it to himself to read through this grand work, epic in scope and breathtaking in sudden illuminations.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Complexity and Real Computation
X
This Item is in Your Inventory
Complexity and Real Computation
X
You must be logged in to review the productsX
X
X
Add Complexity and Real Computation, 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 inadequat, Complexity and Real Computation to the inventory that you are selling on WonderClubX
X
Add Complexity and Real Computation, 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 inadequat, Complexity and Real Computation to your collection on WonderClub |