A taxonomy of problems with fast parallel algorithms
type: Item
instance of: scholarly article
title: A taxonomy of problems with fast parallel algorithms
zbMATH Open document ID: 0575.68045
DOI: 10.1016/S0019-9958(85)80041-3
published in: Information and Control
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D60
zbMATH DE Number: 3919816
zbMATH Keywords: uniform Boolean circuit families
zbMATH Keywords: reducibility
zbMATH Keywords: parallel greedy algorithm
Wikidata QID: Q55891722
author: Stephen Cook
MaRDI profile type: Publication
DBLP publication ID: journals/iandc/Cook85
Recommended article: Q3820005
Recommended article: Paradigms for Fast Parallel Approximability
Recommended article: Q3683539
Recommended article: Q3801091
Recommended article: Q3777446
Recommended article: Efficient parallel algorithms for parameterized problems
Recommended article: Q3766850
Recommended article: A complexity theory of efficient parallel algorithms
Recommended article: Q3805898
description: scientific article