Communicating processes, scheduling, and the complexity of nontermination (Q3034829)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:3034829 |
scientific article; zbMATH DE number 4133507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Communicating processes, scheduling, and the complexity of nontermination |
scientific article; zbMATH DE number 4133507 |
Statements
Communicating processes, scheduling, and the complexity of nontermination (English)
0 references
1990
0 references
computational complexity
0 references
nontermination problem
0 references
communicating processes
0 references
scheduling
0 references
0 references
0 references
0 references
0.7861233949661255
0 references
0.7572247982025146
0 references
0.7562167644500732
0 references
0.738732099533081
0 references
