"Constant-Only Multiplicative Linear Logic is NP-Complete."

Patrick Lincoln, Timothy C. Winkler (1994)

> Home

Details and statistics

DOI: 10.1016/0304-3975(94)00108-1

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/LincolnW94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/LincolnW94
Patrick Lincoln, Timothy C. Winkler:
Constant-Only Multiplicative Linear Logic is NP-Complete. Theor. Comput. Sci. 135(1): 155-169 (1994)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.