Pages that link to "Item:Q1644532"
From MaRDI portal
The following pages link to An algorithm of polynomial order for computing the covering dimension of a finite space (Q1644532):
Displaying 14 items.
- A polynomial-time algorithm for computing the yolk in fixed dimension (Q687092) (← links)
- The dimension Dind of finite topological \(T_0\)-spaces (Q2144650) (← links)
- Order- and graph-theoretic investigation of dimensions of finite topological spaces and Alexandroff spaces (Q2274045) (← links)
- A study of a covering dimension of finite lattices (Q2335133) (← links)
- Algorithmic counting of zero-dimensional finite topological spaces with respect to the covering dimension (Q2660352) (← links)
- Effective calculations of the degree of ∗-covering (Q4645546) (← links)
- (Q4948642) (← links)
- Efficient Computation of the Large Inductive Dimension Using Order- and Graph-theoretic Means (Q4988918) (← links)
- Small and large inductive dimension for ideal topological spaces (Q5049572) (← links)
- A study of the quasi covering dimension of Alexandroff countable spaces using matrices (Q5086844) (← links)
- A study of the order dimension of a poset using matrices (Q5236031) (← links)
- (Q5267471) (← links)
- Covering dimension of finite topological spaces (Q6547361) (← links)
- A study of the small inductive dimension in the area of finite lattices (Q6615243) (← links)
