Stock image for illustration purposes only - book cover, edition or condition may vary.
Theory of Semi-Feasible Algorithms
Hemaspaandra, Lane A.; Torenvliet, Leen
€ 124.12
FREE Delivery in Ireland
Description for Theory of Semi-Feasible Algorithms
Paperback. Series: Monographs in Theoretical Computer Science : An Eatcs Series. Num Pages: 160 pages, biography. BIC Classification: UMB. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 8. Weight in Grams: 254.
An Invitation to the Dance It is an underappreciated fact that sets may have various types of complex ity, and not all types are in harmony with each other. The primary goal of this book is to unify and make more widely accessible a vibrant stream of research-the theory of semi-feasible computation-that perfectly showcases the richness of, and contrasts between, the central types of complexity. The semi-feasible sets, which are most commonly referred to as the P selective sets, are those sets L for which there is a deterministic polynornial time algorithm that, when given as input any two strings ... Read more
An Invitation to the Dance It is an underappreciated fact that sets may have various types of complex ity, and not all types are in harmony with each other. The primary goal of this book is to unify and make more widely accessible a vibrant stream of research-the theory of semi-feasible computation-that perfectly showcases the richness of, and contrasts between, the central types of complexity. The semi-feasible sets, which are most commonly referred to as the P selective sets, are those sets L for which there is a deterministic polynornial time algorithm that, when given as input any two strings ... Read more
Product Details
Format
Paperback
Publication date
2010
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
160
Condition
New
Series
Monographs in Theoretical Computer Science : An Eatcs Series
Number of Pages
150
Place of Publication
Berlin, Germany
ISBN
9783642075810
SKU
V9783642075810
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Theory of Semi-Feasible Algorithms
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, ... Read more