Efficient computation of the large inductive dimension using order- and graph-theoretic means (Q4988918)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7350026
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient computation of the large inductive dimension using order- and graph-theoretic means |
scientific article; zbMATH DE number 7350026 |
Statements
Efficient Computation of the Large Inductive Dimension Using Order- and Graph-theoretic Means (English)
0 references
20 May 2021
0 references
large inductive dimension
0 references
finite topological space
0 references
specialization pre-order
0 references
linear directed binary tree
0 references
0 references
0 references
0 references
0 references
0.8419227600097656
0 references
0.8234421014785767
0 references
0.8216521143913269
0 references
0.819131076335907
0 references
0.7980695366859436
0 references
