Language: English
Published by Birkhauser, Boston, MA, U.S.A., 1991
ISBN 10: 0817635858 ISBN 13: 9780817635855
Seller: Book Dispensary, Concord, ON, Canada
Hardcover. Condition: Very Good. VERY GOOD hardcover, no marks in text, tight square spine; bright and clean. Book.
Seller: Better World Books, Mishawaka, IN, U.S.A.
Condition: Good. Used book that is in clean, average condition without any missing pages.
Seller: BOOKWEST, Phoenix, AZ, U.S.A.
First Edition
Hardcover. Condition: New. 1st Edition. SHRINK-WRAPPED: US SELLER SHIPS FAST FROM USA.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New.
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
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.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 49.30
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New.
Seller: ALLBOOKS1, Direk, SA, Australia
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 166.
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. pp. 166.
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. pp. 166.
Condition: 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.
Language: English
Published by Springer Nature B.V. Nov 2011, 2011
ISBN 10: 1461278368 ISBN 13: 9781461278368
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. 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 .
Condition: New. pp. 180.
Language: English
Published by Springer Nature B.V., 2011
ISBN 10: 1461278368 ISBN 13: 9781461278368
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Language: English
Published by Springer Nature B.V., 2011
ISBN 10: 1461278368 ISBN 13: 9781461278368
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
£ 50.68
Quantity: 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.
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
£ 57.37
Quantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 180.
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 180.