Some results on the complexity of exploiting data dependency in parallel logic programs (Q4734752)
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: Some results on the complexity of exploiting data dependency in parallel logic programs |
scientific article; zbMATH DE number 4121401
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8637615442276001
0 references
0.8010122179985046
0 references
0.8002512454986572
0 references
