Pages that link to "Item:Q5458885"
From MaRDI portal
The following pages link to Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete (Q5458885):
Displaying 14 items.
- Collapsibility to a subcomplex of a given dimension is NP-complete (Q1702356) (← links)
- A computationally intractable problem on simplicial complexes (Q1917045) (← links)
- Shellings from relative shellings, with an application to NP-completeness (Q2046454) (← links)
- Frontiers of sphere recognition in practice (Q2098099) (← links)
- Powerful parallel and symmetric 3D thinning schemes based on critical kernels (Q2251209) (← links)
- Searching combinatorial optimality using graph-based homology information (Q2352515) (← links)
- Parameterized complexity of discrete Morse theory (Q2828168) (← links)
- \(D\)-collapsibility is NP-complete for \(d \geq 4\) (Q2851437) (← links)
- Recognizing shrinkable complexes is NP-complete (Q2970458) (← links)
- Shellability is NP-complete (Q5115809) (← links)
- Recognition of collapsible complexes is NP-complete (Q5964219) (← links)
- NP-Hardness of Computing PL Geometric Category in Dimension 2 (Q6077977) (← links)
- Morphological hierarchies: a unifying framework with new trees (Q6078192) (← links)
- A topological tree of shapes (Q6103053) (← links)