Theory of Semi-Feasible Algorithms
Download or Read eBook Theory of Semi-Feasible Algorithms PDF written by Lane A. Hemaspaandra and published by Springer Science & Business Media. This book was released on 2013-04-17 with total page 156 pages. Available in PDF, EPUB and Kindle.
| Author | : Lane A. Hemaspaandra |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 156 |
| Release | : 2013-04-17 |
| ISBN-10 | : 9783662050804 |
| ISBN-13 | : 3662050803 |
| Rating | : 4/5 (04 Downloads) |
Book Synopsis Theory of Semi-Feasible Algorithms by : Lane A. Hemaspaandra
Book excerpt: The primary goal of this book is unifying and making more widely accessible the vibrant stream of research - spanning more than two decades - on the theory of semi-feasible algorithms. In doing so it demonstrates the richness inherent in central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. The book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science. Another aim of this book is to lay out a path along which the reader can quickly reach the frontiers of current research, and meet and engage the many exciting open problems in this area.
