Order Total (1 Item Items):
Shipping Destination:
Complexity Real Computation by Blum Lenore (36 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (36)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (26)
- As New, Fine or Near Fine (4)
- Very Good or Good (5)
- Fair or Poor (1)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (1)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (14)
- Not Print on Demand (29)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Complexity and Real Computation
Published by Springer (edition 1998), 1997
ISBN 10: 0387982817 ISBN 13: 9780387982816
Language: English
Hardcover. Condition: Good. 1998. It's a preowned item in good condition and includes all the pages. It may have some general signs of wear and tear, such as markings, highlighting, slight damage to the cover, minimal wear to the binding, etc., but they will not affect the overall reading experience.
-
Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
-
Complexity and Real Computation
First Edition
Condition: Good. 1st Edition. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
-
Complexity and Real Computation
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Seller rating 5 out of 5 stars
Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
-
Condition: 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.
-
Condition: New.
-
Condition: New. pp. 474.
-
Condition: 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.
-
Condition: New. pp. 474.
-
Complexity and Real Computation
Seller: Magers and Quinn Booksellers, Minneapolis, MN, U.S.A.
Seller rating 5 out of 5 stars
hardcover. Condition: Very Good. May have light to moderate shelf wear and/or a remainder mark. Complete. Clean pages.
-
Condition: New. pp. 474.
-
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
-
Complexity and Real Computation: Foreword by Richard M. Karp.
Published by New York. Springer-Verlag., 1998
ISBN 10: 0387982817 ISBN 13: 9780387982816
Language: English
Karton. Condition: Sehr gut. Zust: Gutes Exemplar. 453 Seiten, mit Abbildungen, Englisch 818g.
-
Complexity and Real Computation
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 67.02
US$ 15.87 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
PF. Condition: New.
-
Condition: New.
-
Condition: new.
-
Complexity and Real Computation. Foreword by Richard M. Karp.
Published by Springer, New York, 1998
Language: English
Seller: Antiquariat Renner OHG, Albstadt, Germany
Association Member: BOEV
Seller rating 5 out of 5 stars
Hardcover. Condition: 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.
-
Condition: As New. Unread book in perfect condition.
-
Paperback. Condition: Brand New. reprint edition. 469 pages. 9.25x6.10x1.18 inches. In Stock.
-
Complexity and Real Computation
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 103.87
US$ 15.87 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Complexity and Real Computation
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 103.85
US$ 19.87 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Complexity and Real Computation
Published by Springer New York, Springer New York Okt 2012, 2012
ISBN 10: 1461268737 ISBN 13: 9781461268734
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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.
-
Complexity and Real Computation
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 120.61
US$ 19.87 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Taschenbuch. Condition: Neu. Complexity and Real Computation | Lenore Blum (u. a.) | Taschenbuch | xvi | Englisch | 2012 | Springer | EAN 9781461268734 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Complexity and Real Computation
Published by Springer New York, Springer New York, 2012
ISBN 10: 1461268737 ISBN 13: 9781461268734
Language: English
Taschenbuch. Condition: 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.
-
Complexity and Real Computation
Published by Springer New York, Springer New York Okt 1997, 1997
ISBN 10: 0387982817 ISBN 13: 9780387982816
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Buch. Condition: 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.
-
Complexity and Real Computation
Published by Springer New York, Springer New York, 1997
ISBN 10: 0387982817 ISBN 13: 9780387982816
Language: English
Buch. Condition: 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. Condition: Brand New. 1st edition. 453 pages. 9.75x6.50x1.25 inches. In Stock.
-
Complexity and Real Computation
Published by Springer New York Okt 2012, 2012
ISBN 10: 1461268737 ISBN 13: 9781461268734
Language: English
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.
