 |
|
|
Item Details
| Title:
|
EXACT EXPONENTIAL ALGORITHMS
|
| By: |
Fedor V. Fomin, Dieter Kratsch |
| Format: |
Hardback |
| List price:
|
£49.99 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
364216532X |
| ISBN 13: |
9783642165320 |
| Publisher: |
SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG |
| Pub. date: |
27 October, 2010 |
| Edition: |
2010 ed. |
| Series: |
Texts in Theoretical Computer Science. An EATCS Series |
| Pages: |
206 |
| Description: |
Exact Exponential Algorithms provides an introduction to the area and explains the most common algorithmic techniques involved. Thorough exercises are included, in addition to notes and suggestions for further reading. |
| Synopsis: |
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. |
| Illustrations: |
38 Illustrations, black and white; XIV, 206 p. 38 illus. |
| Publication: |
Germany |
| Imprint: |
Springer-Verlag Berlin and Heidelberg GmbH & Co. K |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|