On the complexity of deadlock detection in families of planar nets (Q1285587)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1281081
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of deadlock detection in families of planar nets |
scientific article; zbMATH DE number 1281081 |
Statements
On the complexity of deadlock detection in families of planar nets (English)
0 references
28 April 1999
0 references
massively parallel computers
0 references
0.8294535279273987
0 references
0.782474160194397
0 references
