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

DOI10.1007/PL00009272zbMath0928.68132OpenAlexW2056721069MaRDI QIDQ1293872

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)

Related Items (5)

On the size of the subset partial order ⋮ A simple sub-quadratic algorithm for computing the subset partial order ⋮ On the complexity of strongly connected components in directed hypergraphs ⋮ Computing the subset partial order for dense families of sets ⋮ The Orthogonal Vectors Conjecture for Branching Programs and Formulas

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