Direct encodings of NP-complete problems into Horn sequents of multiplicative linear logic

DOI10.1007/978-3-319-90686-7_2OpenAlexW2802667626MaRDI QIDQ1648864

Satoshi Matsuoka

Publication date: 9 July 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-90686-7_2

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (1)

A formal model for a linear time correctness condition of proof nets of multiplicative linear logic

This page was built for publication: Direct encodings of NP-complete problems into Horn sequents of multiplicative linear logic