scientific article
From MaRDI portal
Publication:3032998
zbMath0691.55009MaRDI QIDQ3032998
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityTuring machineHilbert sequencelocal \({\mathbb{Q}}\)-algebraPoincaré- Betti sequence
Related Items (7)
Hardness of embedding simplicial complexes in \(\mathbb R^d\) ⋮ The computation of the Betti numbers of an elliptic space is an NP-hard problem ⋮ Evasiveness through binary decision diagrams ⋮ Polynomial-time homology for simplicial Eilenberg-MacLane spaces ⋮ Extendability of continuous maps is undecidable ⋮ Computing all maps into a sphere ⋮ Computing simplicial representatives of homotopy group elements
This page was built for publication:
