Pages that link to "Item:Q5133975"
From MaRDI portal
The following pages link to Embeddability in R <sup>3</sup> is NP-hard (Q5133975):
Displaying 7 items.
- Hardness of embedding simplicial complexes in \(\mathbb R^d\) (Q621847) (← links)
- Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete (Q938314) (← links)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- (Q2934634) (← links)
- (Q4633898) (← links)
- Embedding dimensions of simplicial complexes on few vertices (Q6084668) (← links)
- The complexity of recognizing geometric hypergraphs (Q6560147) (← links)