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. Buy exact exponential algorithms texts in theoretical computer science an eatcs series on amazoncom free shipping on qualified orders. Texts in theoretical computer science an eatcs series fedor v fomin dieter kratsch exact exponential algorithms 123 prof dr fedor v fomin university of bergen inst informatics po box 7800 5020 bergen bergen metz fedor v fomin august 2010 dieter kratsch acknowledgements. The design and analysis of exact algorithms leads to a better understanding of hard problems and initiates interesting new combinatorial and algorithmic challenges the last decade has witnessed a rapid development of the area with many new algorithmic techniques discovered this has transformed exact algorithms into a very active research field. The design and analysis of such algorithms will be studied in two chapters in this chapter we start with several branching algorithms and analyze their running fv fomin d kratsch exact exponential algorithms texts in theoretical computer science an eatcs series doi 101007 978 3 642 16533 7 2 c springer verlag berlin heidelberg 2010 13 14
How it works:
1. Register Trial Account.
2. Download The Books as you like ( Personal use )