Pages that link to "Item:Q1129483"
From MaRDI portal
The following pages link to Homology computation by reduction of chain complexes (Q1129483):
Displaying 28 items.
- Discrete Morse theoretic algorithms for computing homology of complexes and maps (Q404257) (← links)
- Computing cup products in \(\mathbb{Z}_2\)-cohomology of 3D polyhedral complexes (Q404268) (← links)
- A novel technique for cohomology computations in engineering practice (Q465836) (← links)
- Čech type approach to computing homology of maps (Q603858) (← links)
- Coreduction homology algorithm for inclusions and persistent homology (Q630667) (← links)
- Coreduction homology algorithm for regular CW-complexes (Q635750) (← links)
- Automatic generation of cuts on large-sized meshes for the \(T-\Omega \) geometric eddy-current formulation (Q660415) (← links)
- Execution spaces for simple higher dimensional automata (Q714637) (← links)
- Reducing complexes in multidimensional persistent homology theory (Q739614) (← links)
- Homology algorithm based on acyclic subspace (Q945134) (← links)
- Simplicial models of trace spaces (Q986682) (← links)
- Coreduction homology algorithm (Q1006400) (← links)
- Measuring and computing natural generators for homology groups (Q1037782) (← links)
- Acyclic partial matchings for multidimensional persistence: algorithm and combinatorial interpretation (Q1722615) (← links)
- Generating cubical complexes from image data and computation of the Euler number (Q1856707) (← links)
- Homological spanning forest framework for 2D image analysis (Q1926586) (← links)
- Homology in electromagnetic boundary value problems (Q1957502) (← links)
- Computation of cubical homology, cohomology, and (co)homological operations via chain contraction (Q2017610) (← links)
- Computing fundamental groups from point clouds (Q2352510) (← links)
- Homology of cellular structures allowing multi-incidence (Q2354674) (← links)
- Allowing cycles in discrete Morse theory (Q2401549) (← links)
- Parallel Homology Computation of Meshes (Q2815188) (← links)
- Computing Homology: A Global Reduction Approach (Q3648794) (← links)
- An algorithmic approach to the construction of homomorphisms induced by maps in homology (Q4942880) (← links)
- Efficient Construction of 2-Chains with a Prescribed Boundary (Q5347535) (← links)
- Chaos in the Lorenz equations: A computer assisted proof. III: Classical parameter values (Q5929069) (← links)
- On modular homology in the Boolean algebra. III (Q5949387) (← links)
- Computing Connection Matrices via Persistence-Like Reductions (Q6144483) (← links)