Pages that link to "Item:Q5458885"

The following pages link to Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete (Q5458885):

Displaying 10 items.

• Collapsibility to a subcomplex of a given dimension is NP-complete (Q1702356) (← links)
• Shellings from relative shellings, with an application to NP-completeness (Q2046454) (← 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 <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>d</mml:mi><mml:mo>⩾</mml:mo><mml:mn>4</mml:mn></mml:math> (Q2851437) (← links)
• (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)