Homology computation by reduction of chain complexes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 3371258 (Why is no real title available?)
- scientific article; zbMATH DE number 3411897 (Why is no real title available?)
- An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
- Chaos in the Lorenz equations: A computer assisted proof. III: Classical parameter values
- Chaos in the Lorenz equations: a computer-assisted proof
- Homology of Noetherian rings and local rings
- Minimal resolutions and other minimal models
- Tate resolutions for commutative graded algebras over a local ring
- Theorems for a price: Tomorrow's semi-rigorous mathematical culture
- Topological invariants, multivalued maps and computer assisted proofs in dynamics
- Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
Cited in
(38)- Parallel homology computation of meshes
- A novel technique for cohomology computations in engineering practice
- Discrete Morse theoretic algorithms for computing homology of complexes and maps
- On modular homology in the Boolean algebra. III
- scientific article; zbMATH DE number 2058536 (Why is no real title available?)
- Allowing cycles in discrete Morse theory
- Simplicial Perturbation Techniques and Effective Homology
- Cellular approximations to the diagonal map
- Polynomial-time homology for simplicial Eilenberg-MacLane spaces
- Homology algorithm based on acyclic subspace
- Chaos in the Lorenz equations: A computer assisted proof. III: Classical parameter values
- Coreduction homology algorithm for inclusions and persistent homology
- Execution spaces for simple higher dimensional automata
- Coreduction homology algorithm for regular CW-complexes
- Acyclic partial matchings for multidimensional persistence: algorithm and combinatorial interpretation
- Coreduction homology algorithm
- Computing Connection Matrices via Persistence-Like Reductions
- Automatic generation of cuts on large-sized meshes for the \(T-\Omega \) geometric eddy-current formulation
- Computing Homology: A Global Reduction Approach
- An algorithmic approach to the construction of homomorphisms induced by maps in homology
- Computing cup products in \(\mathbb{Z}_2\)-cohomology of 3D polyhedral complexes
- Reducing complexes in multidimensional persistent homology theory
- Computing fundamental groups from point clouds
- Simplicial models of trace spaces
- Monomial resolutions for efficient computation of simplicial homology
- Homology of cellular structures allowing multi-incidence
- Homological spanning forest framework for 2D image analysis
- Generating cubical complexes from image data and computation of the Euler number
- Computation of cubical homology, cohomology, and (co)homological operations via chain contraction
- \(\mathbb{Z}_2\)-homology of weak \((p-2)\)-faceless \(p\)-pseudomanifolds may be computed in \(O(n)\) time
- Homology computations via acyclic subspace
- Measuring and computing natural generators for homology groups
- Algorithms in algebraic topology and homological algebra: the problem of complexity
- Recursive coboundary formula for cycles in acyclic chain complexes
- Efficient Construction of 2-Chains with a Prescribed Boundary
- Homology in electromagnetic boundary value problems
- Čech type approach to computing homology of maps
- Morse theoretic signal compression and reconstruction on chain complexes
This page was built for publication: Homology computation by reduction of chain complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129483)
