Overview
- A broad yet integrated study of Semi-Feasible Algorithms
- Brings the reader to the frontiers of current research
- With detailed derivation of results
- Does not require difficult mathematics
- Can be used in a course or for self-study
- Includes supplementary material: sn.pub/extras
Part of the book series: Monographs in Theoretical Computer Science. An EATCS Series (EATCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (6 chapters)
Keywords
About this book
Reviews
From the reviews:
"This book focuses mainly on the complexity of P-selective sets … . a course from this text would require a highly-motivated instructor who can give the intuitive ideas leaving the details to the book. The book would also serve as a reasonable reference for those doing research in this area." (Lance Fortnow, SIGACT News, Vol. 35 (2), 2004)
Authors and Affiliations
Bibliographic Information
Book Title: Theory of Semi-Feasible Algorithms
Authors: Lane A. Hemaspaandra, Leen Torenvliet
Series Title: Monographs in Theoretical Computer Science. An EATCS Series
DOI: https://doi.org/10.1007/978-3-662-05080-4
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2003
Hardcover ISBN: 978-3-540-42200-6Published: 28 October 2002
Softcover ISBN: 978-3-642-07581-0Published: 09 December 2010
eBook ISBN: 978-3-662-05080-4Published: 17 April 2013
Series ISSN: 1431-2654
Series E-ISSN: 2193-2069
Edition Number: 1
Number of Pages: X, 150
Topics: Programming Techniques, Algorithm Analysis and Problem Complexity, Computation by Abstract Devices, Discrete Mathematics in Computer Science, Algorithms, Combinatorics