عنوان

Theory of Semi-Feasible Algorithms

شابک

3662050803

شابک

9783662050804

شماره

b579373

عنوان اصلي

Theory of Semi-Feasible Algorithms

نام عام مواد

[Book]

نام نخستين پديدآور

by Lane A. Hemaspaandra, Leen Torenvliet.

محل نشرو پخش و غیره

Berlin, Heidelberg

نام ناشر، پخش کننده و غيره

Springer Berlin Heidelberg

تاریخ نشرو بخش و غیره

2003

نام خاص و کميت اثر

(x, 149 pages)

عنوان فروست

Monographs in Theoretical Computer Science An EATCS Series.

متن يادداشت

1. Introduction to Semi-Feasible Computation --; 2. Advice --; 3. Lowness --; 4. Hardness for Complexity Classes --; 5. Closures --; 6. Generalizations and Related Notions --; A. Definitions of Reductions and Complexity Classes, and Notation List --; A.1 Reductions --; A.2 Complexity Classes --; A.3 Some Other Notation --; References.

متن يادداشت

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.

موضوع مستند نشده

Computational complexity.

موضوع مستند نشده

Computer science.

موضوع مستند نشده

Computer software.

شماره رده

نشانه اثر

مستند نام اشخاص تاييد نشده

by Lane A. Hemaspaandra, Leen Torenvliet.

مستند نام اشخاص تاييد نشده

Lane A Hemaspaandra

مستند نام اشخاص تاييد نشده

Leen Torenvliet

نام الکترونيکي

نوع ماده

[Book]

تكميل شده

Y