✦ LIBER ✦

Constant-only multiplicative linear logic is NP-complete

✍ Scribed by Patrick Lincoln; Timothy Winkler

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On NP-completeness in Linear Logic

✍ Alexey P. Kopylov 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 712 KB

Multiple Treatment Comparisons in Linear

✍ H.-P. Piepho 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB 👁 2 views