On the Complexity of the Interlace Polynomial

@article{Blser2008OnTC,
  title={On the Complexity of the Interlace Polynomial},
  author={M. Bl{\"a}ser and C. Hoffmann},
  journal={ArXiv},
  year={2008},
  volume={abs/0707.4565}
}
  • M. Bläser, C. Hoffmann
  • Published 2008
  • Mathematics, Computer Science
  • ArXiv
  • We consider the two-variable interlace polynomial introduced by Arratia, Bollobas and Sorkin (2004). We develop graph transformations which allow us to derive point-to-point reductions for the interlace polynomial. Exploiting these reductions we obtain new results concerning the computational complexity of evaluating the interlace polynomial at a fixed point. Regarding exact evaluation, we prove that the interlace polynomial is #P-hard to evaluate at every point of the plane, except on one line… CONTINUE READING
    30 Citations
    Complexity of the Bollobás–Riordan Polynomial. Exceptional Points and Uniform Reductions
    • 9
    • PDF
    A Multivariate Interlace Polynomial and its Computation for Graphs of Bounded Clique-Width
    • B. Courcelle
    • Mathematics, Computer Science
    • Electron. J. Comb.
    • 2008
    • 31
    • PDF
    Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
    • 8
    • PDF
    On the interlace polynomials
    • L. Traldi
    • Mathematics, Computer Science
    • J. Comb. Theory, Ser. B
    • 2013
    • 25
    • Highly Influenced
    • PDF
    Complexity and Approximability of the Cover Polynomial
    • 6
    • PDF
    Weighted Interlace Polynomials
    • L. Traldi
    • Mathematics, Computer Science
    • Comb. Probab. Comput.
    • 2010
    • 9
    • Highly Influenced
    • PDF
    Advances in the Computational Complexity of Holant Problems
    • 4
    • PDF
    The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree
    • 7
    A graph polynomial for independent sets of bipartite graphs
    • 22
    • PDF

    References

    SHOWING 1-10 OF 24 REFERENCES
    Distance Hereditary Graphs and the Interlace Polynomial
    • 26
    • PDF
    A Two-Variable Interlace Polynomial
    • 56
    • Highly Influential
    • PDF
    The interlace polynomial of a graph
    • 97
    • PDF
    A multivariate interlace polynomial
    • 8
    • PDF
    The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
    • A. Sokal
    • Mathematics, Physics
    • Surveys in Combinatorics
    • 2005
    • 307
    • PDF
    The Computational Complexity of Tutte Invariants for Planar Graphs
    • D. Vertigan
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 2005
    • 61
    The Complexity of Enumeration and Reliability Problems
    • L. Valiant
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 1979
    • 1,829
    • PDF