Parameterized Complexity News
نویسندگان
چکیده
Editors Frances Rosamond (Univ Bergen) [email protected] and Valia Mitsou (Univ Paris Diderot) [email protected]. Congratulations to all for many awards and prizes, graduates, new jobs, and wonderful research. ALGO 2017 showcased ten awards and 8 of them were related to parameterized complexity! This newsletter includes articles by the IPEC Best Paper and Excellent Student Paper Award winners. Articles by PACE winners will be featured in the January 2018 newsletter. See ALGO photos on Mike’s facebook page @MikeFellowsFPT.
منابع مشابه
On the parameterized complexity of manipulating Top Trading Cycles
We study the problem of exchange when 1) agents are endowed with heterogeneous indivisible objects, and 2) there is no money. In general, no rule satisfies the three central properties Pareto-efficiency, individual rationality, and strategy-proofness [62]. Recently, it was shown that Top Trading Cycles is NP-hard to manipulate [32], a relaxation of strategy-proofness. However, parameterized com...
متن کاملADAPTIVE FUZZY TRACKING CONTROL FOR A CLASS OF PERTURBED NONLINEARLY PARAMETERIZED SYSTEMS USING MINIMAL LEARNING PARAMETERS ALGORITHM
In this paper, an adaptive fuzzy tracking control approach is proposed for a class of single-inputsingle-output (SISO) nonlinear systems in which the unknown continuous functions may be nonlinearlyparameterized. During the controller design procedure, the fuzzy logic systems (FLS) in Mamdani type are applied to approximate the unknown continuous functions, and then, based on the minimal learnin...
متن کاملDescribing Parameterized Complexity Classes
We describe parameterized complexity classes by means of classical complexity theory and descriptive complexity theory. For every classical complexity class we introduce a parameterized analogue in a natural way. In particular, the analogue of polynomial time is the class of all fixed-parameter tractable problems. We develop a basic complexity theory for the parameterized analogues of classical...
متن کاملAn Overview of Non-Uniform Parameterized Complexity
We consider several non-uniform variants of parameterized complexity classes that have been considered in the literature. We do so in a homogenous notation, allowing a clear comparison of the various variants. Additionally, we consider some novel (non-uniform) parameterized complexity classes that come up in the framework of parameterized knowledge compilation. We provide some (inclusion and se...
متن کاملOn the Space Complexity of Parameterized Problems
Parameterized complexity theory measures the complexity of computational problems predominantly in terms of their parameterized time complexity. The purpose of the present paper is to demonstrate that the study of parameterized space complexity can give new insights into the complexity of well-studied parameterized problems like the feedback vertex set problem. We show that the undirected and t...
متن کامل