Published by Birkhauser, Boston, MA, U.S.A., 1991
ISBN 10: 0817635858 ISBN 13: 9780817635855
Language: English
Seller: Book Dispensary, Concord, ON, Canada
£ 7.63
Convert currencyQuantity: 1 available
Add to basketHardcover. Condition: Very Good. VERY GOOD hardcover, no marks in text, tight square spine; bright and clean. Book.
Seller: Mispah books, Redhill, SURRE, United Kingdom
Hardcover. Condition: Like New. Like NewLIKE NEW. book.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 50.82
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
£ 56.47
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.
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. pp. 166.
Seller: Books Puddle, New York, NY, U.S.A.
£ 60.96
Convert currencyQuantity: 1 available
Add to basketCondition: New. pp. 166.
Seller: BOOKWEST, Phoenix, AZ, U.S.A.
First Edition
£ 45.79
Convert currencyQuantity: 1 available
Add to basketHardcover. Condition: New. 1st Edition. SHRINK-WRAPPED: US SELLER SHIPS FAST FROM USA.
Seller: Biblios, Frankfurt am main, HESSE, Germany
£ 67.46
Convert currencyQuantity: 1 available
Add to basketCondition: New. pp. 166.
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New.
£ 57.31
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. KlappentextIn mathematics there are limits, speed limits of a sort, on how many computational steps are required to solve certain problems. The theory of computational complexity deals with such limits, in particular whether solving an n.
Published by Springer Nature B.V. Nov 2011, 2011
ISBN 10: 1461278368 ISBN 13: 9781461278368
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
£ 73.54
Convert currencyQuantity: 2 available
Add to basketTaschenbuch. Condition: Neu. Neuware - In mathematics there are limits, speed limits of a sort, on how many computational steps are required to solve certain problems. The theory of computational complexity deals with such limits, in particular whether solving an n-dimensional version of a particular problem can be accomplished with, say, 2 n n steps or will inevitably require 2 steps. Such a bound, together with a physical limit on computational speed in a machine, could be used to establish a speed limit for a particular problem. But there is nothing in the theory of computational complexity which precludes the possibility of constructing analog devices that solve such problems faster. It is a general goal of neural network researchers to circumvent the inherent limits of serial computation. As an example of an n-dimensional problem, one might wish to order n distinct numbers between 0 and 1. One could simply write all n! ways to list the numbers and test each list for the increasing property. There are much more efficient ways to solve this problem; in fact, the number of steps required by the best sorting algorithm applied to this problem is proportional to n In n .
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
£ 52.95
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Published by Springer Nature B.V., 2011
ISBN 10: 1461278368 ISBN 13: 9781461278368
Language: English
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
£ 51.63
Convert currencyQuantity: Over 20 available
Add to basketPAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Published by Springer Nature B.V., 2011
ISBN 10: 1461278368 ISBN 13: 9781461278368
Language: English
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
£ 56
Convert currencyQuantity: Over 20 available
Add to basketPAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
£ 56.09
Convert currencyQuantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 156.