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

DOI10.1007/PL00009272zbMATH Open0928.68132OpenAlexW2056721069MaRDI QIDQ1293872FDOQ1293872

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

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

zbMATH Keywords

combinatorial set theory

Mathematics Subject Classification ID

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

Cited In (7)

• On the complexity of strongly connected components in directed hypergraphs
• Title not available (Why is that?)
• On Computing the Subset Graph of a Collection of Sets
• The Orthogonal Vectors Conjecture for Branching Programs and Formulas
• On the size of the subset partial order
• A simple sub-quadratic algorithm for computing the subset partial order
• Computing the subset partial order for dense families 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)