An algorithm computing homotopy groups.
type: Item
instance of: scholarly article
title: An algorithm computing homotopy groups.
zbMATH Open document ID: 1037.55502
DOI: 10.1016/S0378-4754(96)00021-3
author: Pedro Real
published in: Mathematics and Computers in Simulation
publication date: 2003-05-27T00:00:00Z
Mathematics Subject Classification ID: 55Q05
Mathematics Subject Classification ID: 55R20
zbMATH DE Number: 1920707
zbMATH Keywords: computer algebra
zbMATH Keywords: topology
zbMATH Keywords: homotopy groups
zbMATH Keywords: homology
Wikidata QID: Q59388672
MaRDI profile type: Publication
cites work: Finite computability of Postnikov complexes
cites work: Q5580926
cites work: A combinatorial definition of homotopy groups
cites work: Q4721240
cites work: The computability problem in algebraic topology
full work available at URL: s0378-4754(96)00021-3
OpenAlex ID: W2018891868
Recommended article: An algorithm for low dimensional group homology.
Recommended article: Computing the homology of groups: the geometric way.
Recommended article: Q4317313
Recommended article: Q5845362
Recommended article: Q3545334
Recommended article: Discrete Geometry for Computer Imagery
Recommended article: Algorithmically finite groups.
description: scientific article; zbMATH DE number 1920707