ISBN: 9780387982816 - complexity and real computation: foreword by richard m. karp (21 Ergebnisse)

Zustand: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In fair condition, suitable as a study copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,900grams, ISBN:9780387982816.…

Hardcover. Zustand: new. New Copy. Customer Service Guaranteed.

Zustand: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

hardcover. Zustand: Good. Our good condition books are generally good for reading but not for gifting or collecting. They could have imperfections such as creasing, fanning, inscriptions, margin notes, yellowing, staining on edge or cover or pages, bumps, scuffs, etc etc (sometimes multiple of these). It's a wide category that encompasses anything that isn't almost-new down to anything that is slightly better than poor. We would NOT recommend gifting Good books - these should be considered reading copies. Our books are dispatched from a Yorkshire former cotton mill. We list via barcode/ISBN so please note that the images are stock images and may not be the exact copy you receive, furthermore the details about edition and year might not be accurate as many publishers reuse the same ISBN for multiple editions and as we simply scan a barcode or enter an ISBN we do not check the validity of the edition data when listing. If you're looking for an exact edition please don't order (at least not without checking with us first, although we don't always have time to check). We aim to dispatch prompty, the service used will depend on order value and book size. We can ship to most countries, see our shipping policies. Payment is via Abe only.…

Hardcover. Zustand: Like New. Like new.

Hardcover. Zustand: Sehr gut. N.Y., Springer (1998). gr.8°. 47 figs. 3 color plates. XVI, 453 p. Hardbound. Small ownership inscription on flyleaves and title, small annotation on title, otherwise in very good condition.

Zustand: Used. pp. 474.

Zustand: As New. Unread book in perfect condition.

Zustand: Used. pp. 474.

Zustand: Used. pp. 474.

Zustand: New.

Zustand: New. In English.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Buch. Zustand: 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.…

Hardcover. Zustand: Brand New. 1st edition. 453 pages. 9.75x6.50x1.25 inches. In Stock.

Buch. Zustand: 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.…

Gebunden. Zustand: 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.…

Hardback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Buch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. 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.…