Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. A. Amihud and Y. Choueka. Loop programs and polinomially computable functions. International Journal of Computer Mathematics, Section A, 9:195–205, 1981.
2. John C., Cherniavsky. Simple programs realize exactly Presburger formulas. SIAM Journal on Computing, 5:666–677, 1976.
3. Arthur Delcher and Simon Kasif. Some results on the complexity of exploiting data dependency in parallel logic programs. Journal of Logic Programming, 6:229–241, 1989.
4. Thomas Eiter and Georg Gottob. Complexity results for logic-based abdunction. In Informal Proceedings of the Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic programming, pages 438–449, Washigton DC, 1992.
5. Michael Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.