Exact Exponential Algorithms (Paperback)

Idioma: inglés

Editorial: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2012

3642265669 / 9783642265662

Serie: Libro 32 de 45 - Texts in Theoretical Computer Science. An EATCS

  • Tapa blanda
  • Nuevo
Ver todos los detalles

Librería: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller

Vendedor de 5 estrellas

Vendedor de AbeBooks desde 22 de junio de 2007

Ver los artículos de este vendedor
Tapa blanda

Condición: Nuevo

EUR 85,37

Envío por EUR 31,87 
Se envía de Australia a Estados Unidos de America

Cantidad disponible: 1 disponibles

Añadir al carrito
Devoluciones gratuitas de 30 días

Descripción del artículo del vendedor

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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

N° de ref. del artículo 9783642265662

Título
Exact Exponential Algorithms (Paperback)
Autor
Fedor V. Fomin
Editorial
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin
Año de publicación
2012
Estado
new
Encuadernación
Paperback
Idioma
inglés
ISBN 10
3642265669
ISBN 13
9783642265662
Serie
Libro 32 de 45: Texts in Theoretical Computer Science. An EATCS

AussieBookSeller

Truganina, VIC, Australia

Vendedor de 5 estrellas

Vendedor de AbeBooks desde 22 de junio de 2007

Tarifas de envío de Australia a Estados Unidos de America

ArtículoDe 25 a 45 días hábilesDe 8 a 14 días hábiles
Primer artículoEUR 31,87EUR 37,90
Los plazos de entrega los establecen los vendedores y varían según el transportista y la ubicación. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relación con cargos adicionales para cubrir cualquier aumento en los costes de envío de los artículos.

Métodos de pago

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay

Información empresarial del vendedor

The Nile Group Pty Ltd

42 Apex Drive
Truganina, VIC Australia 3029