Some results on the complexity of exploiting data dependency in parallel logic programs (Q4734752): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:49, 7 February 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
