The following pages link to Olivier Raynaud (Q353307):
Displayed 14 items.
- Recursive decomposition and bounds of the lattice of Moore co-families. (Q353309) (← links)
- The complexity of embedding orders into small products of chains (Q603886) (← links)
- A fast algorithm for building lattices (Q1606994) (← links)
- (Q1884956) (redirect page) (← links)
- Computational aspects of the 2-dimension of partially ordered sets (Q1884957) (← links)
- Recursive decomposition tree of a Moore co-family and closure algorithm. (Q2248537) (← links)
- A closed sets based learning classifier for implicit authentication in web browsing (Q2286388) (← links)
- Twin Vertices in Hypergraphs (Q3439545) (← links)
- Counting of Moore Families for n=7 (Q3552281) (← links)
- Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies (Q3627677) (← links)
- A fast incremental algorithm for building lattices (Q4409027) (← links)
- (Q4501560) (← links)
- (Q4907347) (← links)
- Formal Concept Analysis (Q5898496) (← links)