A simple sub-quadratic algorithm for computing the subset partial order
type: Item
instance of: scholarly article
title: A simple sub-quadratic algorithm for computing the subset partial order
zbMATH Open document ID: 0875.68463
DOI: 10.1016/0020-0190(95)00165-4
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 985215
zbMATH Keywords: Set-theoretic algorithms
zbMATH Keywords: Extremal sets
zbMATH Keywords: Subset partial order
zbMATH Keywords: Subset graph
zbMATH Keywords: Lexicographic order
zbMATH Keywords: Algorithms
author: Paul A. Pritchard
MaRDI profile type: Publication
full work available at URL: 0020-0190(95)00165-4
OpenAlex ID: W2069684871
cites work: On the computational power of pushdown automata
cites work: Dynamic Perfect Hashing: Upper and Lower Bounds
cites work: Three Partition Refinement Algorithms
cites work: Opportunistic algorithms for eliminating supersets
cites work: An old sub-quadratic algorithm for finding extremal sets
cites work: On Computing the Subset Graph of a Collection of Sets
cites work: A fast bit-parallel algorithm for computing the subset partial order
cites work: Finding extremal sets in less than quadratic time
description: scientific article; zbMATH DE number 985215