On Mon, 22 Dec 2014, Nathann Cohen wrote:
I wondered how one could compute the dimension of a poset, i.e. a smallest set
of
linear extension whose interection is the poset.
It is apparently known for being NP-Hard, but that never stopped us in the past.
Plus I am curious to learn how this could be done. We need some code for that !
Tell me if you have any idea, please !
No ideas.
Should we made *something* for questions like this? As an another example,
there is no known easy way to compute Frattini sublattice, i.e.
intersection of all proper sublattices of a given lattice.
Should we just make a function with note "This is direct computation with
no optimization at all."? Being able to compute some examples it might be
easier to try other algorithms, find some corner cases etc.
--
Jori Mäntysalo
