A simple sub-quadratic algorithm for computing the subset partial order
- 22 December 1995
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 56 (6) , 337-341
- https://doi.org/10.1016/0020-0190(95)00165-4
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Dynamic Perfect Hashing: Upper and Lower BoundsSIAM Journal on Computing, 1994
- Finding extremal sets in less than quadratic timeInformation Processing Letters, 1993
- Opportunistic algorithms for eliminating supersetsActa Informatica, 1991
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987