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.

N� de ref. del art�culo 5832966

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo

Exact Exponential Algorithms (Texts in Theoretical Computer Science. An Eatcs Series)

Editor

Springer

Fecha de publicaci�n

2010

Idioma

Ingl�s

ISBN 10

364216532X

ISBN 13

9783642165320

Encuadernaci�n

Encuadernaci�n de tapa dura

Estado

Good

Cat�logos de vendedores

Mathematics

Acerca de

Sinopsis

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.

Acerca del autor

The authors are highly regarded academics and educators in theoretical computer science, and in algorithmics in particular.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

Based in central Lincoln, Anybook Ltd. sells exclusively on line. We specialise in academic works. All our books are in good condition or better, unless otherwise described. We will respond to your enquiry promptly and mail books out within 24 hours of receiving payment. We use Royal Mail and other reputable couriers at greatly discounted postage rates. If you find cheaper postage from the UK, we'll match it. Remember if you are unsatisfied in any way with any purchase, we will give you a complete and unconditional refund. All books are hand wrapped. All e-mails answered personally. All books are offered subject to being unsold.

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

Anybook Ltd.
28 West End,, Burgh le Marsh,, Lincolnshire, PE24 5EY, United Kingdom

Condiciones de venta y env�o

Condiciones de venta

Anybook Ltd is a company registered in England and Wales. Company Registration Number: 3692291. VAT Number: GB753406145. Share Capital GBP100.

Registered Offices:
28 West End,
Burgh le Marsh,
Lincolnshire,
PE24 5EY
UK

Customer Services:
2,Outer Circle Business Park,
Outer Circle Road,
Lincoln
LN2 4HX
UK

Email Address: sales@anybook.com
Telephone Number: +44 (0) 1522 519 991
Authorized Representative: Ms. Claire Williams

Condiciones de env�o

Orders usually ship within 1 business day. We use Royal Mail and other reputable couriers at greatly discounted postage rates. If your book order is heavy or over-sized, or valuable enough to require tracking, we may contact you to let you know extra shipping is required.