Parametrized complexity of expansion height
From MaRDI portal
Recommendations
- Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete
- Collapsibility to a subcomplex of a given dimension is NP-complete
- The parameterized complexity of finding a 2-sphere in a simplicial complex
- The parameterized complexity of finding a 2-sphere in a simplicial complex
- Homeomorphism of 2-Complexes is Graph Isomorphism Complete
Cites work
- scientific article; zbMATH DE number 1819874 (Why is no real title available?)
- scientific article; zbMATH DE number 1819881 (Why is no real title available?)
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 529110 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 3335104 (Why is no real title available?)
- Algebraic topology of finite topological spaces and applications
- Algorithmic topology and classification of 3-manifolds
- Combinatorial decomposition of simplicial 3-spheres and bridge indices of knots
- Free Groups and Handlebodies
- Group Presentations and Formal Deformations
- Hardness of approximation for Morse matching
- On incidence matrices, nuclei and homotopy types
- On the dunce hat
- Parametrized complexity theory.
- Recognition of collapsible complexes is NP-complete
- Simple Homotopy Types
Cited in
(2)
This page was built for publication: Parametrized complexity of expansion height
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075747)
