Type-Based Complexity Analysis for Fork Processes (Q4910427)
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 6145841
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Type-Based Complexity Analysis for Fork Processes |
scientific article; zbMATH DE number 6145841 |
Statements
Type-Based Complexity Analysis for Fork Processes (English)
0 references
18 March 2013
0 references
implicit computational complexity
0 references
tiering
0 references
secure information flow
0 references
concurrent programming
0 references
PSpace
0 references
0.8465032
0 references
0.84065664
0 references
0.8350971
0 references
0.82821363
0 references
0 references
0.81915796
0 references