Stock image for illustration purposes only - book cover, edition or condition may vary.
Theory of Semi-Feasible Algorithms
Leen Torenvliet Lane A. Hemaspaandra
€ 126.45
FREE Delivery in Ireland
Description for Theory of Semi-Feasible Algorithms
Hardcover. This text presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness and NP-hardness. Series: Monographs in Theoretical Computer Science : An Eatcs Series. Num Pages: 160 pages, biography. BIC Classification: UMB. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 241 x 166 x 16. Weight in Grams: 380. Series: Monographs in Theoretical Computer Science : an Eatcs Series. 159 pages, 1, black & white illustrations. This text presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness and NP-hardness. Cateogry: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. BIC Classification: UMB. Dimension: 241 x 166 x 16. Weight: 380.
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
Hardback
Publication date
2002
Publisher
Springer
Number of pages
159
Condition
New
Series
Monographs in Theoretical Computer Science : An Eatcs Series
Number of Pages
150
Place of Publication
Berlin, Germany
ISBN
9783540422006
SKU
V9783540422006
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