Pages that link to "Item:Q1702356"
From MaRDI portal
The following pages link to Collapsibility to a subcomplex of a given dimension is NP-complete (Q1702356):
Displaying 5 items.
- A computationally intractable problem on simplicial complexes (Q1917045) (← links)
- The worst way to collapse a simplex (Q2055286) (← links)
- \(D\)-collapsibility is NP-complete for \(d \geq 4\) (Q2851437) (← links)
- Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete (Q5458885) (← links)
- Recognition of collapsible complexes is NP-complete (Q5964219) (← links)