Some results on the complexity of exploi
โ
Arthur Delcher; Simon Kasif
๐
Article
๐
1989
๐
Elsevier Science
๐
English
โ 937 KB
We consider several problems related to maintaining and analyzing dataflow dependencies in AND-parallel execution of logic programs. Several problems related to optimal selection of literals for parallel execution are established to be intractable (NP-complete). Most importantly, we establish intrac