Linear higher-order matching is NP-complete

DOI10.1007/10721975_9MaRDI QIDQ2723896zbMATH OpenFDO

Authors Philippe de Groote

Publication date 8 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/10721975_9

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Recommendations

• Term Rewriting and Applications
• scientific article; zbMATH DE number 2043532
• Computer Science Logic
• Complexity of the higher order matching
• scientific article; zbMATH DE number 2090083

Cited in

(7)

• Direct encodings of NP-complete problems into Horn sequents of multiplicative linear logic
• \(\mathcal{IV}\)-matching is strongly \textsf{NP}-hard
• Complexity of the higher order matching
• scientific article; zbMATH DE number 2090083 (Why is no real title available?)
• Tractable and intractable second-order matching problems
• Computer Science Logic
• Term Rewriting and Applications

This page was built for publication: Linear higher-order matching is NP-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2723896)