Coreduction homology algorithm
type: Item
instance of: scholarly article
title: Coreduction homology algorithm
zbMATH Open document ID: 1163.68041
author: Marian Mrozek
author: Bogdan Batko
published in: Discrete \& Computational Geometry
publication date: 2009-03-24T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 5532472
zbMATH Keywords: Homology algorithm
zbMATH Keywords: Cubical set
zbMATH Keywords: Reduction methods
describes a project that uses: Chom
describes a project that uses: Homology
describes a project that uses: CAPD
describes a project that uses: CHomP
MaRDI profile type: Publication
full work available at URL: s00454-008-9073-y
OpenAlex ID: W2021125686
cites work: On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets
cites work: Q5331776
cites work: An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
cites work: Q3740904
cites work: On efficient sparse integer matrix Smith normal form computations
cites work: Q4418129
cites work: Topological persistence and simplification
cites work: Q4228492
cites work: Homology computation by reduction of chain complexes
cites work: Computational homology
cites work: Q4934434
cites work: Critical Behavior in the Satisfiability of Random Boolean Expressions
cites work: Q4157293
cites work: Graph approach to the computation of the homology of continuous maps
cites work: Index pairs algorithms
cites work: Homology algorithm based on acyclic subspace
cites work: Homology of representable sets
cites work: Q3827224
cites work: Q4227352
cites work: Computing the Minimum Fill-In is NP-Complete
cites work: Computing persistent homology
DOI: 10.1007/S00454-008-9073-Y
description: scientific article; zbMATH DE number 5532472