Pages that link to "Item:Q1644532"

The following pages link to An algorithm of polynomial order for computing the covering dimension of a finite space (Q1644532):

Displaying 8 items.

• 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)
• 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)