"Lower-bound Time-complexity Analysis of Logic Programs."

Andy King, Kish Shen, Florence Benoy (1997)

Details and statistics

DOI:

access: unavailable

type: Conference or Workshop Paper

metadata version: 2013-12-04

a service of  Schloss Dagstuhl - Leibniz Center for Informatics