Cup product persistence and its efficient computation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- (Quasi)periodicity quantification in video data, using topology
- A higher homotopic extension of persistent (co)homology
- Clear and compress: computing persistent homology in chunks
- Computational topology for data analysis
- Computational topology. An introduction
- Computing persistent homology
- Dualities in persistent (co)homology
- Efficient computation of image persistence
- HIGHER ORDER LINKING NUMBERS
- Induced matchings of barcodes and the algebraic stability of persistence
- Mod two homology and cohomology
- Persistence Steenrod modules
- Persistence stability for geometric complexes
- Persistent Cup Product Structures and Related Invariants
- Persistent Cup-Length
- Persistent homology for kernels, images, and cokernels
- Products of cocycles and extensions of mappings
- Ripser: efficient computation of Vietoris-Rips persistence barcodes
- Simple upper bounds for partition functions
- Sliding Window Persistence of Quasiperiodic Functions
- Stability of persistence diagrams
- Testing isomorphism of graded algebras
- The Gudhi library: simplicial complexes and persistent homology
- The compressed annotation matrix: an efficient data structure for computing persistent cohomology
- The structure and stability of persistence modules
- \textsc{Phat} -- persistent homology algorithms toolbox
This page was built for publication: Cup product persistence and its efficient computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6895851)
