Collapsibility to a subcomplex of a given dimension is NP-complete (Q1702356): Difference between revisions

@@ Property / cites work @@
+Discrete Morse theory for cellular resolutions
@@ Property / cites work: Discrete Morse theory for cellular resolutions / rank @@
+Normal rank
@@ Property / cites work @@
+Random Discrete Morse Theory and a New Library of Triangulations
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of Discrete Morse Theory
@@ Property / cites work: Parameterized Complexity of Discrete Morse Theory / rank @@
+Normal rank
@@ Property / cites work @@
+On discrete Morse functions and combinatorial decompositions
+Normal rank
@@ Property / cites work @@
+A computationally intractable problem on simplicial complexes
+Normal rank
@@ Property / cites work @@
+Morse theory for cell complexes
@@ Property / cites work: Morse theory for cell complexes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4819371
@@ Property / cites work: Q4819371 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Optimal Morse Matchings
@@ Property / cites work: Computing Optimal Morse Matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial algebraic topology
@@ Property / cites work: Combinatorial algebraic topology / rank @@
+Normal rank
@@ Property / cites work @@
+Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete
+Normal rank
@@ Property / cites work @@
+Recognition of collapsible complexes is NP-complete
+Normal rank