Parameter Compilation

@article{Chen2015ParameterC,
  title={Parameter Compilation},
  author={Hubie Chen},
  journal={ArXiv},
  year={2015},
  volume={abs/1503.00260}
}
  • Hubie Chen
  • Published 2015
  • Computer Science
  • ArXiv
  • 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… CONTINUE READING

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-2 OF 2 CITATIONS

    An Overview of Non-Uniform Parameterized Complexity

    • Ronald de Haan
    • Mathematics, Computer Science
    • Electronic Colloquium on Computational Complexity
    • 2015

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 14 REFERENCES

    Parameterized Compilability

    VIEW 1 EXCERPT

    A Knowledge Compilation Map

    VIEW 2 EXCERPTS

    Preprocessing of Intractable Problems

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    On the complexity of existential positive queries

    VIEW 4 EXCERPTS

    Parameterized Complexity Theory

    • Jörg Flum, Martin Grohe
    • Mathematics, Computer Science
    • Texts in Theoretical Computer Science. An EATCS Series
    • 2006

    Some Consequences of Non-Uniform Conditions on Uniform Classes

    • Chee-Keng Yap
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 1983