Some results on the complexity of exploiting data dependency in parallel logic programs (Q4734752): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0743-1066(89)90015-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2094490424 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:53, 20 March 2024
scientific article; zbMATH DE number 4121401
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some results on the complexity of exploiting data dependency in parallel logic programs |
scientific article; zbMATH DE number 4121401 |
Statements
Some results on the complexity of exploiting data dependency in parallel logic programs (English)
0 references
1989
0 references
dataflow analysis
0 references
parallel logic programs
0 references
optimal selection of literals
0 references
PROLOG
0 references
complexity of maintaining data-dependency changes
0 references
