"Horn Programming in Linear Logic Is NP-Complete"

Max I. Kanovich (1992)

Details and statistics

DOI: 10.1109/LICS.1992.185533

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

a service of  Schloss Dagstuhl - Leibniz Center for Informatics