"Linear Higher-Order Matching Is NP-Complete."

Philippe de Groote (2000)

Details and statistics

DOI: 10.1007/10721975_9

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

a service of  Schloss Dagstuhl - Leibniz Center for Informatics