Collapsibility to a Subcomplex of a Given Dimension is NP-Complete

@article{Paolini2017CollapsibilityTA,
  title={Collapsibility to a Subcomplex of a Given Dimension is NP-Complete},
  author={Giovanni Paolini},
  journal={Discrete & Computational Geometry},
  year={2017},
  volume={59},
  pages={246-251}
}
  • Giovanni Paolini
  • Published in Discret. Comput. Geom. 2017
  • Computer Science, Mathematics
  • In this paper we extend the works of Tancer, Malgouyres and Francés, showing that $$(d,k)$$(d,k)-Collapsibility is NP-complete for $$d\ge k+2$$d≥k+2 except (2, 0). By $$(d,k)$$(d,k)-Collapsibility we mean the following problem: determine whether a given d-dimensional simplicial complex can be collapsed to some k-dimensional subcomplex. The question of establishing the complexity status of $$(d,k)$$(d,k)-Collapsibility was asked by Tancer, who proved NP-completeness of (d, 0) and $$(d,1)$$(d,1… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    References

    Publications referenced by this paper.
    SHOWING 1-9 OF 9 REFERENCES

    Recognition of Collapsible Complexes is NP-Complete

    • Martin Tancer
    • Computer Science, Mathematics
    • Discret. Comput. Geom.
    • 2016

    Combinatorial Algebraic Topology

    • Dmitry N. Kozlov
    • Mathematics, Computer Science
    • Algorithms and computation in mathematics
    • 2008
    VIEW 3 EXCERPTS

    Computing Optimal Morse Matchings