8. Parameterized intractability: the W-hierarchy - COMP6741: Parameterized and Exact Computation
نویسنده
چکیده
1 Reminder: Polynomial Time Reductions and NP-completeness Polynomial-time reduction Definition 1. A polynomial-time reduction from a decision problem Π1 to a decision problem Π2 is a polynomialtime algorithm, which, for any instance of Π1 produces an equivalent instance of Π2. If there exists a polynomial-time reduction from Π1 to Π2, we say that Π1 is polynomial-time reducible to Π2 and write Π1 ≤P Π2.
منابع مشابه
Fuzzy adaptive tracking control for a class of nonlinearly parameterized systems with unknown control directions
This paper addresses the problem of adaptive fuzzy tracking control for aclass of nonlinearly parameterized systems with unknown control directions.In this paper, the nonlinearly parameterized functions are lumped into the unknown continuous functionswhich can be approximated by using the fuzzy logic systems (FLS) in Mamdani type. Then, the Nussbaum-type function is used to de...
متن کاملOn the Structure of Parameterized Problems in NP (Extended Abstract)
Fixed-parameter intractability of optimization problems in NP is studied based on computational models with limited nondeterminism. Strong evidence is provided that many NP optimization problems are not fixed-parameter tractable and that the fixed-parameter intractability hierarchy (the W -hierarchy) does not collapse.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015