Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Seller: PAPER CAVALIER UK, London, United Kingdom
Condition: very good. Gently used. May include previous owner's signature or bookplate on the front endpaper, sticker on back and/or remainder mark on text block.
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Seller: HPB Inc., Dallas, TX, U.S.A.
hardcover. Condition: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority!
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!
Language: English
Published by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2012
ISBN 10: 3642265669 ISBN 13: 9783642265662
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condition: new. Paperback. For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad). The running time of slow algorithms is usually exponential. This book is about bad algorithms. There are several reasons why we are interested in exponential time algorithms. Most of us believe that there are many natural problems which cannot be solved by polynomial time algorithms. The most famous and oldest family of hard problems is the family of NP complete problems. Most likely there are no polynomial time al gorithms solving these hard problems and in the worst case scenario the exponential running time is unavoidable. Every combinatorial problem is solvable in ?nite time by enumerating all possi ble solutions, i. e. by brute force search. But is brute force search always unavoid able? De?nitely not. Already in the nineteen sixties and seventies it was known that some NP complete problems can be solved signi?cantly faster than by brute force search. Three classic examples are the following algorithms for the TRAVELLING SALESMAN problem, MAXIMUM INDEPENDENT SET, and COLORING. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Language: English
Published by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2012
ISBN 10: 3642311547 ISBN 13: 9783642311543
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condition: new. Paperback. This book constitutes the refereed proceedings of the 13th International Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012, held in Helsinki, Finland, in July 2012, co-located with the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012. The 34 papers were carefully reviewed and selected from a total of 127 submissions. The papers present original research and cover a wide range of topics in the field of design and analysis of algorithms and data structures. This book constitutes the refereed proceedings of the 13th International Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012, held in Helsinki, Finland, in July 2012, co-located with the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Condition: New.
Condition: New.
Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,550grams, ISBN:9783642165320.
Condition: As New. Unread book in perfect condition.
Condition: As New. Unread book in perfect condition.
Condition: As New. Unread book in perfect condition.
Condition: New.
Condition: As New. Unread book in perfect condition.
Condition: As New. Unread book in perfect condition.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 50.43
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 50.43
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 50.43
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 50.43
Quantity: Over 20 available
Add to basketCondition: New. In.
£ 50.43
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 50.43
Quantity: Over 20 available
Add to basketCondition: New. In.
Condition: New.
Paperback. Condition: New.
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New.
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New.
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New.
Condition: New.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New.
Paperback. Condition: New.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New.