Some results on the complexity of exploiting data dependency in parallel logic programs

From MaRDI portal
Publication:4734752

DOI10.1016/0743-1066(89)90015-0zbMATH Open0684.68024OpenAlexW2094490424MaRDI QIDQ4734752FDOQ4734752

Simon Kasif, Arthur L. Delcher

Publication date: 1989

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(89)90015-0




Recommendations





Cited In (12)





This page was built for publication: Some results on the complexity of exploiting data dependency in parallel logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4734752)