Articles liés à Complexity and Real Computation
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 47,23
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Complexity and Real Computation
Image fournie par le vendeur
Complexity and Real Computation
Edité par
Springer New York, 2012
ISBN 10 : 1461268737
ISBN 13 : 9781461268734
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. * Unique work on this core topic * Written by internationally recognised specialists in mathematics and computing * Provides the basics for numerous practical industrial applications, e.g. AI, robotics, digital cashUnique work on this core topic * Wr. N° de réf. du vendeur 4189510
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Complexity and Real Computation
Edité par
Springer New York Okt 2012, 2012
ISBN 10 : 1461268737
ISBN 13 : 9781461268734
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9781461268734
Quantité disponible : 2 disponible(s)
Image d'archives
Complexity and Real Computation
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9781461268734_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Complexity and Real Computation
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9781461268734
Quantité disponible : Plus de 20 disponibles
Image d'archives
Complexity and Real Computation
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9781461268734
Quantité disponible : 10 disponible(s)
Image fournie par le vendeur
Complexity and Real Computation
Edité par
Springer New York, Springer New York Okt 2012, 2012
ISBN 10 : 1461268737
ISBN 13 : 9781461268734
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware -Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. The objects of study are algorithms defined within a formal model of computation. Upper bounds on the computational complexity of a problem are usually derived by constructing and analyzing specific algorithms. Meaningful lower bounds on computational complexity are harder to come by, and are not available for most problems of interest. The dominant approach in complexity theory is to consider algorithms as oper ating on finite strings of symbols from a finite alphabet. Such strings may represent various discrete objects such as integers or algebraic expressions, but cannot rep resent real or complex numbers, unless the numbers are rounded to approximate values from a discrete set. A major concern of the theory is the number of com putation steps required to solve a problem, as a function of the length of the input string.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 472 pp. Englisch. N° de réf. du vendeur 9781461268734
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Complexity and Real Computation
Edité par
Springer New York, Springer New York, 2012
ISBN 10 : 1461268737
ISBN 13 : 9781461268734
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. The objects of study are algorithms defined within a formal model of computation. Upper bounds on the computational complexity of a problem are usually derived by constructing and analyzing specific algorithms. Meaningful lower bounds on computational complexity are harder to come by, and are not available for most problems of interest. The dominant approach in complexity theory is to consider algorithms as oper ating on finite strings of symbols from a finite alphabet. Such strings may represent various discrete objects such as integers or algebraic expressions, but cannot rep resent real or complex numbers, unless the numbers are rounded to approximate values from a discrete set. A major concern of the theory is the number of com putation steps required to solve a problem, as a function of the length of the input string. N° de réf. du vendeur 9781461268734
Quantité disponible : 1 disponible(s)
Image d'archives
Complexity and Real Computation
Edité par
Springer-Verlag New York Inc., 2012
ISBN 10 : 1461268737
ISBN 13 : 9781461268734
Neuf
Paperback / softback
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 748. N° de réf. du vendeur C9781461268734
Quantité disponible : Plus de 20 disponibles
Image d'archives
Complexity and Real Computation
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 474. N° de réf. du vendeur 2648035492
Quantité disponible : 4 disponible(s)
Image d'archives
Complexity and Real Computation
impression à la demandeVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. PRINT ON DEMAND pp. 474. N° de réf. du vendeur 1848035502
Quantité disponible : 4 disponible(s)