Articoli correlati a Complexity and Real Computation
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
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?”.- 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 Problems.- 13 The Condition Number in ?(H(d).- 14 Complexity and the Condition Number.- 15 Linear Programming.- 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.
Product Description
Book by Blum Lenore Cucker Felipe Shub Michael Smale Steve
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreSpringer
- Data di pubblicazione2012
- ISBN 10 1461268737
- ISBN 13 9781461268734
- RilegaturaCopertina flessibile
- Numero di pagine472
Compra usato
Condizioni: molto buonoBook is in Used-VeryGood condition... Scopri di più su questo articolo
EUR 74,33
Spese di spedizione:
GRATIS
In U.S.A.
Compra nuovo
Scopri di più su questo articolo
EUR 52,10
Spese di spedizione:
GRATIS
In U.S.A.
Altre edizioni note dello stesso titolo
I migliori risultati di ricerca su AbeBooks
Immagini fornite dal venditore
Complexity and Real Computation by Blum, Lenore, Cucker, Felipe, Shub, Michael, Smale, Steve [Paperback ]
Da: booksXpress, Bayonne, NJ, U.S.A.
Valutazione del venditore 4 su 5 stelle
Soft Cover. Condizione: new. Codice articolo 9781461268734
Quantità: 10 disponibili
Foto dell'editore
Complexity and Real Computation
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar2716030028345
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Complexity and Real Computation
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 19493973-n
Quantità: 5 disponibili
Foto dell'editore
Complexity and Real Computation
Print on DemandDa: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Codice articolo ria9781461268734_lsuk
Quantità: Più di 20 disponibili
Foto dell'editore
Complexity and Real Computation
Da: GF Books, Inc., Hawthorne, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Very Good. Book is in Used-VeryGood condition. Pages and cover are clean and intact. Used items may not include supplementary materials such as CDs or access codes. May show signs of minor shelf wear and contain very limited notes and highlighting. 1.32. Codice articolo 1461268737-2-3
Quantità: 1 disponibili
Foto dell'editore
Complexity and Real Computation
Da: Book Deals, Tucson, AZ, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. New! This book is in the same immaculate condition as when it was published 1.32. Codice articolo 353-1461268737-new
Quantità: 1 disponibili
Foto dell'editore
Complexity and Real Computation
Da: Book Deals, Tucson, AZ, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Fine. Like New condition. Great condition, but not exactly fully crisp. The book may have been opened and read, but there are no defects to the book, jacket or pages. 1.32. Codice articolo 353-1461268737-lkn
Quantità: 1 disponibili
Foto dell'editore
Complexity and Real Computation
Da: Books Unplugged, Amherst, NY, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Buy with confidence! Book is in new, never-used condition 1.32. Codice articolo bk1461268737xvz189zvxnew
Quantità: 1 disponibili
Foto dell'editore
Complexity and Real Computation
Da: Book Deals, Tucson, AZ, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Good. Good condition. This is the average used book, that has all pages or leaves present, but may include writing. Book may be ex-library with stamps and stickers. 1.32. Codice articolo 353-1461268737-gdd
Quantità: 1 disponibili
Immagini fornite dal venditore
Complexity and Real Computation
Editore:
Springer New York Okt 2012, 2012
ISBN 10: 1461268737
ISBN 13: 9781461268734
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 developa 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. 472 pp. Englisch. Codice articolo 9781461268734
Quantità: 2 disponibili