On the parallel complexity of digraph reachability
type: Item
instance of: scholarly article
title: On the parallel complexity of digraph reachability
zbMATH Open document ID: 0938.68945
DOI: 10.1016/0020-0190(94)00153-7
author: Samir Khuller
author: Uzi Vishkin
published in: Information Processing Letters
publication date: 2000-06-21T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 699131
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)00153-7
OpenAlex ID: W1974462315
cites work: Matrix multiplication via arithmetic progressions
cites work: Q4385522
description: scientific article; zbMATH DE number 699131