The UvA-LINKER will give you a range of other options to find the full text of a publication (including a direct link to the full-text if it is located on another database on the internet).
De UvA-LINKER biedt mogelijkheden om een publicatie elders te vinden (inclusief een directe link naar de publicatie online als deze beschikbaar is in een database op het internet).
faculty: "FNWI" and publication year: "2010"
| Authors||L.A. Hemaspaandra, L. Torenvliet|
|Title||Theory of semi-feasible algorithms|
|Title series||Monographs in Theoretical Computer Science: an EATCS Series|
|Faculty||Faculty of Science|
|Institute/dept.||FNWI: Institute for Logic, Language and Computation (ILLC)|
|Abstract||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.
|Note||Softcover reprint of hardcover 1st ed. 2003|
Use this url to link to this page: http://dare.uva.nl/en/record/474392
Contact us about this recordNotify a colleague
Add to bookbag