The parallel complexity of coarsest set partition problems
type: Item
instance of: scholarly article
title: The parallel complexity of coarsest set partition problems
zbMATH Open document ID: 0780.68056
DOI: 10.1016/0020-0190(92)90095-D
author: Sang Cho
author: Dung T. Huynh
published in: Information Processing Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 92098
zbMATH Keywords: coarsest set partition problems
zbMATH Keywords: parallel complexity
zbMATH Keywords: parallel algorithms
MaRDI profile type: Publication
cites work: Q4773298
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Q3992991
cites work: Q3862379
cites work: Q4045961
cites work: Nondeterministic Space is Closed under Complementation
cites work: CCS expressions, finite state processes, and three problems of equivalence
cites work: A linear time solution to the single function coarsest partition problem
cites work: Three Partition Refinement Algorithms
cites work: A parallel algorithm for the minimization of finite state automata
cites work: The method of forced enumeration for nondeterministic automata
description: scientific article; zbMATH DE number 92098