Bit-vector encoding for partially ordered sets

DOI10.1007/BFB0019423MaRDI QIDQ4525257zbMATH OpenFDO

Authors Lhouari Nourine, M. A. Habib, Michel Habib

Publication date 21 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0019423

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Structure theory of lattices (06B05) Nonnumerical algorithms (68W05)

Recommendations

• Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies
• Computational aspects of the 2-dimension of partially ordered sets
• Tree structure for distributive lattices and its applications
• An Efficient Data Structure for Lattice Operations
• Fast lattice browsing on sparse representations

Cited in

(12)

• LP structures on type lattices and some refactoring problems
• Tree structure for distributive lattices and its applications
• Computational aspects of the 2-dimension of partially ordered sets
• Lattice classification by cut-through coding.
• Embedding ordered sets into distributive lattices
• Sorting parity encodings by reusing variables
• Succinct posets
• Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies
• Fast lattice browsing on sparse representations
• Time and space efficient representations of distributive lattices
• The secret life of keys: on the calculation of mechanical lock systems
• The complexity of embedding orders into small products of chains

This page was built for publication: Bit-vector encoding for partially ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4525257)