Blum Lenore (34 results)
- Hardcover
Seller: Shakespeare Book House, Rockford, IL, U.S.A.Shakespeare Book House
Contact seller4-star sellerCondition: Used - Good
US$ 25.89
US$ 3.99 shippingShips within U.S.A.Quantity: 1 available
Condition: good. Used book that is clean, average condition without any missing pages.
- Hardcover
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United KingdomPhatpocket Limited
Contact seller5-star sellerCondition: Used - Good
US$ 22.90
US$ 14.27 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
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.
- Hardcover
Seller: Anybook.com, Lincoln, United KingdomAnybook.com
Contact seller5-star sellerCondition: Used - Fair
US$ 20.14
US$ 18.23 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
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.
- Hardcover
Seller: Sell Books, Elland, YORKS, United KingdomSell Books
Contact seller5-star sellerCondition: Used - Good
US$ 24.54
US$ 16.29 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
hardcover. Condition: 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
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.Romtrade Corp.
Contact seller5-star sellerCondition: New
US$ 73.66
Free ShippingShips within U.S.A.Quantity: 1 available
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.
- Hardcover
Seller: Moe's Books, Berkeley, CA, U.S.A.Moe's Books
Contact seller4-star sellerCondition: Used - As new
US$ 70.00
US$ 6.50 shippingShips within U.S.A.Quantity: 1 available
Hardcover. Condition: Like New. Like new.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 70.15
US$ 16.06 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Softcover
Seller: Chiron Media, Wallingford, , United KingdomChiron Media
Contact seller5-star sellerCondition: New
US$ 66.25
US$ 20.77 shippingShips from United Kingdom to U.S.A.Quantity: 10 available
PF. Condition: New.
- Hardcover
Seller: Antiquariat Renner OHG, Albstadt, , GermanyAntiquariat Renner OHG
Contact seller5-star sellerCondition: Used - Near fine
US$ 41.72
US$ 52.07 shippingShips from Germany to U.S.A.Quantity: 1 available
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.
- Hardcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: Used
US$ 94.70
US$ 3.99 shippingShips within U.S.A.Quantity: 1 available
Condition: Used. pp. 474.
- Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
US$ 97.84
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Hardcover
Seller: Majestic Books, Hounslow, , United KingdomMajestic Books
Contact seller4-star sellerCondition: Used
US$ 92.50
US$ 8.71 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: Used. pp. 474.
- Hardcover
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: Used
US$ 95.72
US$ 11.51 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: Used. pp. 474.
- Hardcover
Seller: GoldBooks, Denver, CO, U.S.A.GoldBooks
Contact seller5-star sellerCondition: New
US$ 102.45
US$ 5.50 shippingShips within U.S.A.Quantity: 1 available
Hardcover. Condition: new. New Copy. Customer Service Guaranteed.
- Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
US$ 105.71
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: Revaluation Books, Exeter, , United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 95.02
US$ 16.76 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Paperback. Condition: Brand New. reprint edition. 469 pages. 9.25x6.10x1.18 inches. In Stock.
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 108.34
US$ 16.06 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
US$ 108.33
US$ 20.11 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
US$ 120.61
US$ 20.11 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
More images- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 60.01
US$ 81.00 shippingShips from Germany to U.S.A.Quantity: 5 available
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.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 69.79
US$ 73.54 shippingShips from Germany to U.S.A.Quantity: 1 available
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 mode…l 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
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 109.92
US$ 74.96 shippingShips from Germany to U.S.A.Quantity: 1 available
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 co…mputation. 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
Blum, Lenore (Editor)/ Cucker, Felipe/ Shub, Michael/ Smale, Steve/ Blum, Lenore
- Hardcover
Seller: Revaluation Books, Exeter, , United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 181.64
US$ 16.76 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Hardcover. Condition: Brand New. 1st edition. 453 pages. 9.75x6.50x1.25 inches. In Stock.
- Softcover
- First Edition
Seller: Jeremy Norman's historyofscience, Novato, CA, U.S.A.Jeremy Norman's historyofscience
Contact seller4-star sellerBlum, Lenore (1942- ); Manuel Blum, (1938- ); Michael Shub (1943- ). A simple unpredictable pseudo-random number generator. Offprint from SIAM Journal of Computing 15 (1986). 364-383pp. 255 x 175 mm. Original printed wrappers. Fine. First Edition, Offprint Issue. The Blum Blum Shub (BBS) pseudorandom number generator, proposed i…n 1986 by Lenore Blum, Manuel Blum and Michael Shub, "is based on the operation of squaring numbers modulo the products of two large primes. Its security can be reduced to the computational hardness assumption that integer factorization is infeasible." See the Wikipedia page for Blum Blum Shub. From the library of Martin Davis. .
- Softcover
- Print on Demand
Seller: Brook Bookstore On Demand, Napoli, NA, ItalyBrook Bookstore On Demand
Contact seller3-star sellerCondition: New
US$ 55.09
US$ 7.87 shippingShips from Italy to U.S.A.Quantity: Over 20 available
Condition: new. Questo è un articolo print on demand.
Seller: Jeremy Norman's historyofscience, Novato, CA, U.S.A.Jeremy Norman's historyofscience
Contact seller4-star sellerBlum, Lenore (1942- ); Michael Shub (1943- ); Stephen Smale (1930- ). On a theory of computation over the real numbers' NP completeness, recursive functions and universal machines. Offset typescript. 1989. 64pp. 280 x 217 mm. Unbound; stapled. Very good. Rare Preprint Edition. "In computation theory, the Blum-Shub-Smale machine,… or BSS machine, is a model of computation introduced by Lenore Blum, Michael Shub and Stephen Smale, intended to describe computations over the real numbers. Essentially, a BSS machine is a Random Access Machine with registers that can store arbitrary real numbers and that can compute rational functions over reals in a single time step. It is closely related to the Real RAM model. "BSS machines are more powerful than Turing machines, because the latter are by definition restricted to a finite set of symbols. A Turing machine can represent a countable set (such as the rational numbers) by strings of symbols, but this does not extend to the uncountable real numbers" (Wikipedia article on Blum-Shub-Smale machine). From the library of Martin Davis. .
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
US$ 63.75
US$ 26.62 shippingShips from Germany to U.S.A.Quantity: 2 available
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 i…t 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.
- Softcover
- Print on Demand
Seller: moluna, Greven, , Germanymoluna
Contact seller5-star sellerCondition: New
US$ 56.30
US$ 56.69 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: 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 cashUn…ique work on this core topic * Wr.
- Hardcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
US$ 101.97
US$ 26.62 shippingShips from Germany to U.S.A.Quantity: 2 available
Buch. 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 provi…des 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.
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
US$ 63.75
US$ 69.43 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: 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.
