A fast bit-parallel algorithm for computing the subset partial order

DOI10.1007/PL00009272MaRDI QIDQ1293872zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 12 January 2000

Published in Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial set theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• A simple sub-quadratic algorithm for computing the subset partial order
• Computing the subset partial order for dense families of sets
• The subset partial order: computing and combinatorics
• On Computing the Subset Graph of a Collection of Sets
• On the size of the subset partial order

Cited in

(9)

• The subset partial order: computing and combinatorics
• Computing the subset partial order for dense families of sets
• On the size of the subset partial order
• On the complexity of strongly connected components in directed hypergraphs
• scientific article; zbMATH DE number 4035132 (Why is no real title available?)
• Practical algorithms for finding extremal sets
• The Orthogonal Vectors Conjecture for Branching Programs and Formulas
• A simple sub-quadratic algorithm for computing the subset partial order
• On Computing the Subset Graph of a Collection of Sets

This page was built for publication: A fast bit-parallel algorithm for computing the subset partial order

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