Pages that link to "Item:Q5964219"

The following pages link to Recognition of collapsible complexes is NP-complete (Q5964219):

Displaying 30 items.

• A counterexample to Wegner's conjecture on good covers (Q664352) (← links)
• Complexity of simplicial homology and independence complexes of chordal graphs (Q679745) (← links)
• Collapsibility to a subcomplex of a given dimension is NP-complete (Q1702356) (← links)
• On distance-preserving elimination orderings in graphs: complexity and algorithms (Q1752455) (← links)
• A computationally intractable problem on simplicial complexes (Q1917045) (← links)
• Recognising a partitionable simplicial complex is in \(\text{NP}\) (Q1917504) (← links)
• Shellings from relative shellings, with an application to NP-completeness (Q2046454) (← links)
• The worst way to collapse a simplex (Q2055286) (← links)
• Unlabeled sample compression schemes and corner peelings for ample and maximum classes (Q2121466) (← links)
• Inverting the discrete curl operator: a novel graph algorithm to find a vector potential of a given vector field (Q2157129) (← links)
• Extremal examples of collapsible complexes and random discrete Morse theory (Q2358820) (← links)
• A note on independence complexes of chordal graphs and dismantling (Q2363095) (← links)
• \(D\)-collapsibility is NP-complete for \(d \geq 4\) (Q2851437) (← links)
• Recognizing shrinkable complexes is NP-complete (Q2970458) (← links)
• Neural Codes, Decidability, and a New Local Obstruction to Convexity (Q4634350) (← links)
• (Q5075747) (← links)
• Computing Persistent Homology of Flag Complexes via Strong Collapses (Q5088987) (← links)
• Shellability is NP-complete (Q5115809) (← links)
• (Q5116531) (← links)
• Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete (Q5458885) (← links)
• What Makes a Neural Code Convex? (Q5737775) (← links)
• Determining the Trisection Genus of Orientable and Non-Orientable PL 4-Manifolds through Triangulations (Q5866507) (← links)
• Recognition of collapsible complexes is NP-complete (Q5964219) (← links)
• Generalised cone complexes and tropical moduli in polymake (Q6060356) (← links)
• New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023 (Q6076085) (← links)
• NP-Hardness of Computing PL Geometric Category in Dimension 2 (Q6077977) (← links)
• Completions and ramifications (Q6160789) (← links)
• Shellable tilings on relative simplicial complexes and their \(h\)-vectors (Q6168278) (← links)
• Cholesky-like preconditioner for Hodge Laplacians via heavy collapsible subcomplex (Q6623667) (← links)
• Random simple-homotopy theory (Q6645900) (← links)