Books > Computing & IT > General theory of computing > Data structures
|
Buy Now
Theory of Semi-Feasible Algorithms (Hardcover, 2003 ed.)
Loot Price: R3,101
Discovery Miles 31 010
|
|
Theory of Semi-Feasible Algorithms (Hardcover, 2003 ed.)
Series: Monographs in Theoretical Computer Science. An EATCS Series
Expected to ship within 10 - 15 working days
|
This book presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. Research into semi-feasible computation has already developed a rich set of tools, yet is young enough to have an abundance of fresh, open issues. Being essentially self-contained, the book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science in general. Newcomers are introduced to the field systematically and guided to the frontiers of current research. Researchers already active in the field will appreciate the book as a valuable source of reference.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
You might also like..
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.