你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada exact exponential algorithms
Type
Physical Book
Author
Publisher
Year
2012
Language
English
Pages
206
Format
Paperback
Dimensions
23.4x15.6x1.2 cm
Weight
0.31 kg.
ISBN
3642265669
ISBN13
9783642265662
Categories

exact exponential algorithms

Fedor V. Fomin (Author) · Dieter Kratsch (Author) · Springer · Paperback

exact exponential algorithms - Fomin, Fedor V. ; Kratsch, Dieter

Cheaper New Book Imported to Taiwan
Delivery: 14 Oct - 27 Oct Shipping: 16 to 20 business days.
NT$ 1,867
Faster New Book Imported to Taiwan
Delivery: 09 Oct - 19 Oct Shipping: 13 to 14 business days.
NT$ 2,208
NT$ 1,867

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "exact exponential algorithms"

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews