Browse by Journal
Jump to: K
Number of items: 1.
K
King, Andy and Shen, Kish and Benoy, Florence (1997) Lower-bound Time-Complexity Analysis of Logic Programs. In: Maluszynski, Jan, ed. Proceedings of the 1996 International Symposium. Logic Programming . MIT Press, Cambridge, Massachusetts, USA, pp. 261-276. ISBN 0-262-63180-6. (KAR id:21434) |