Constant-Only Multiplicative Linear Logic is NP-Complete (1994)

by P Lincoln, T Winkler
Venue:Theoretical Computer Science