The compressed annotation matrix: an efficient data structure for computing persistent cohomology (Q893322): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q2849358
aliases / en / 0aliases / en / 0
 
The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
description / endescription / en
 
scientific article; zbMATH DE number 6208886
Property / title
 
The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology (English)
Property / title: The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1331.68056 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-40450-4_59 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
17 September 2013
Timestamp+2013-09-17T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 17 September 2013 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6208886 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2593124839 / rank
 
Normal rank

Revision as of 08:54, 2 May 2024

scientific article; zbMATH DE number 6208886
  • The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
Language Label Description Also known as
English
The compressed annotation matrix: an efficient data structure for computing persistent cohomology
scientific article; zbMATH DE number 6208886
  • The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology

Statements

The compressed annotation matrix: an efficient data structure for computing persistent cohomology (English)
0 references
The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology (English)
0 references
0 references
0 references
0 references
19 November 2015
0 references
17 September 2013
0 references
persistent cohomology
0 references
annotation
0 references
data structure
0 references
simplicial complex
0 references
algorithm
0 references
implementation
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references