The parallel complexity of simple logic programs
F Afrati, CH Papadimitriou - Journal of the ACM (JACM), 1993 - dl.acm.org
Journal of the ACM (JACM), 1993•dl.acm.org
We consider logic programs with a single recursive rules, whose right-hand side consists of
binary relations forming a chain. We give a complete characterization of all programs of this
form that are computable in NC (assuming that P≠ NC). Our proof uses ideas from automata
and language theory, and the combinatorics of strings.
binary relations forming a chain. We give a complete characterization of all programs of this
form that are computable in NC (assuming that P≠ NC). Our proof uses ideas from automata
and language theory, and the combinatorics of strings.
We consider logic programs with a single recursive rules, whose right-hand side consists of binary relations forming a chain. We give a complete characterization of all programs of this form that are computable in NC (assuming that P ≠ NC). Our proof uses ideas from automata and language theory, and the combinatorics of strings.
ACM Digital LibraryShowing the best result for this search. See all results