2026-07-21T21:12:26Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5577 2024-03-06T10:36:35Z ddc:004 open_access

Parameter Compilation Chen, Hubie compilation parameterized complexity In resolving instances of a computational problem, if multiple instances of interest share a feature in common,it may be fruitful to compile this feature into a format that allows for more efficient resolution, even if the compilation is relatively expensive. In this article, we introduce a formal framework for classifying problems according to their compilability. The basic object in our framework is that of a parameterized problem, which here is a language along with a parameterization—a map which provides, for each instance, a so-called parameter on which compilation may be performed. Our framework is positioned within the paradigm of parameterized complexity, and our notions are relatable to established concepts in the theory of parameterized complexity. Indeed, we view our framework as playing a unifying role, integrating together parameterized complexity and compilability theory. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Hubie Chen 2015 Is Part Of LIPIcs, Volume 43, 10th International Symposium on Parameterized and Exact Computation (IPEC 2015) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.IPEC.2015.127 urn:nbn:de:0030-drops-55771 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.127 eng https://creativecommons.org/licenses/by/3.0/legalcode