Pages that link to "Item:Q1917045"
From MaRDI portal
The following pages link to A computationally intractable problem on simplicial complexes (Q1917045):
Displaying 14 items.
- Hardness of embedding simplicial complexes in \(\mathbb R^d\) (Q621847) (← links)
- Complexity of simplicial homology and independence complexes of chordal graphs (Q679745) (← links)
- Optimal discrete Morse functions for 2-manifolds (Q1410593) (← links)
- Collapsibility to a subcomplex of a given dimension is NP-complete (Q1702356) (← links)
- Non total-unimodularity neutralized simplicial complexes (Q1707913) (← links)
- Optimal reconstruction might be hard (Q1943654) (← links)
- Approximation algorithms for Max Morse matching (Q2362103) (← links)
- Parameterized complexity of discrete Morse theory (Q2828168) (← links)
- Computing Optimal Discrete Morse Functions (Q3439152) (← links)
- (Q4633898) (← links)
- Shellability is NP-complete (Q5115809) (← links)
- Optimal reconstruction might be hard (Q5405898) (← 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)