Parameterized Computational Feasibility

摘要: Many natural computational problems have input consisting of two or more parts. For example, the might consist a graph and positive integer. many we may view one inputs as parameter study how complexity problem varies if is held fixed. applications involving such parameter, only small range values practical significance, so that fixed- concern. In studying problems, it therefore important to framework in which can make qualitative distinctions about contribution problem. this paper survey for investigating parameterized present number new results theory.