Constant-Only Multiplicative Linear Logic is NP-Complete

Patrick Lincoln, Timothy C. Winkler. Constant-Only Multiplicative Linear Logic is NP-Complete. Theoretical Computer Science, 135(1):155-169, 1994.

Abstract

Abstract is missing.