Published by Springer (edition 1998), 1997
ISBN 10: 0387982817 ISBN 13: 9780387982816
Language: English
Seller: BooksRun, Philadelphia, PA, U.S.A.
£ 26.93
Convert currencyQuantity: 1 available
Add to basketHardcover. Condition: Good. 1998. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported.
£ 29.89
Convert currencyQuantity: 1 available
Add to basketCondition: Good. 1st Edition. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
£ 50.82
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
£ 53.26
Convert currencyQuantity: 1 available
Add to basketCondition: 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.
£ 38.40
Convert currencyQuantity: 1 available
Add to baskethardcover. Condition: Very Good. May have light to moderate shelf wear and/or a remainder mark. Complete. Clean pages.
£ 52.23
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Paperback. Condition: Brand New. reprint edition. 469 pages. 9.25x6.10x1.18 inches. In Stock.
£ 78.90
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
£ 78.91
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
£ 25.93
Convert currencyQuantity: 1 available
Add to basketCondition: VeryGood. There is a signature or handwriting on the inside front cover. Fast shipping and order satisfaction guaranteed. A portion of your purchase benefits Non-Profit Organizations, First Aid and Fire Stations!
£ 53.76
Convert currencyQuantity: 1 available
Add to basketHardcover. Condition: Like New. Like new!
£ 86.57
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
£ 28.37
Convert currencyQuantity: 1 available
Add to basketCondition: good. Fast Shipping - Good and clean conditions used book. Pages and cover are intact. Limited notes marks and highlighting may be present. May show signs of normal shelf wear and bends on edges. Item may be missing CDs or access codes. May include library marks.
Hardcover. Condition: Like New. Like New. book.
Paperback. Condition: Like New. Like New. book.
£ 46.08
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
£ 89.80
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
£ 100.62
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
£ 94.15
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
£ 25.82
Convert currencyQuantity: 1 available
Add to basketHardcover. 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!
Published by Springer-Verlag New York Inc., US, 1997
ISBN 10: 0387982817 ISBN 13: 9780387982816
Language: English
Seller: Rarewaves.com UK, London, United Kingdom
£ 110.42
Convert currencyQuantity: Over 20 available
Add to basketHardback. Condition: New. 1998 ed. 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.
Published by Springer-Verlag New York Inc., US, 1997
ISBN 10: 0387982817 ISBN 13: 9780387982816
Language: English
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
£ 126.15
Convert currencyQuantity: Over 20 available
Add to basketHardback. Condition: New. 1998 ed. 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.
Publication Date: 1989
Seller: Jeremy Norman's historyofscience, Novato, CA, U.S.A.
£ 576.05
Convert currencyQuantity: 1 available
Add to basketBlum, 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 BlumShubSmale 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. .
Seller: moluna, Greven, Germany
£ 42.21
Convert currencyQuantity: Over 20 available
Add to basketCondition: 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.
Seller: moluna, Greven, Germany
£ 65.12
Convert currencyQuantity: Over 20 available
Add to basketGebunden. 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 cashUnique work on this core topic * Wr.