Items related to 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.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Complexity and Real Computation
Stock Image
Complexity and Real Computation
Seller: Best Price, Torrance, CA, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. SUPER FAST SHIPPING. Seller Inventory # 9781461268734
Quantity: 2 available
Stock Image
Complexity and Real Computation (Paperback)
Published by
Springer-Verlag New York Inc., New York, NY, 2012
ISBN 10: 1461268737
ISBN 13: 9781461268734
New
Paperback
Seller: Grand Eagle Retail, Mason, OH, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. 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. 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. Upper bounds on the computational complexity of a problem are usually derived by constructing and analyzing specific algorithms. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781461268734
Quantity: 1 available
Stock Image
Complexity and Real Computation
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar2716030028345
Quantity: Over 20 available
Stock Image
Complexity and Real Computation
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9781461268734
Quantity: Over 20 available
Seller Image
Complexity and Real Computation
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 19493973-n
Quantity: 15 available
Stock Image
Complexity and Real Computation
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9781461268734_new
Quantity: Over 20 available
Seller Image
Complexity and Real Computation
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 19493973
Quantity: 15 available
Stock Image
Complexity and Real Computation
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 4 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9781461268734
Quantity: 10 available
Seller Image
Complexity and Real Computation
Published by
Springer New York Okt 2012, 2012
ISBN 10: 1461268737
ISBN 13: 9781461268734
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9781461268734
Quantity: 2 available
Stock Image
Complexity and Real Computation
Published by
Springer-Verlag New York Inc., 2012
ISBN 10: 1461268737
ISBN 13: 9781461268734
New
Paperback / softback
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 748. Seller Inventory # C9781461268734
Quantity: Over 20 available