Constant-only multiplicative linear logic is NP-complete
- 5 December 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 135 (1) , 155-169
- https://doi.org/10.1016/0304-3975(94)00108-1
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Computational interpretations of linear logicTheoretical Computer Science, 1993
- Concurrent Constraint ProgrammingPublished by MIT Press ,1993
- Decision problems for propositional linear logicAnnals of Pure and Applied Logic, 1992
- Linear logicTheoretical Computer Science, 1987