✦ LIBER ✦

On NP-completeness in Linear Logic

✍ Scribed by Alexey P. Kopylov

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 712 KB
Volume: 75
Category: Article
ISSN: 0168-0072
DOI: 10.1016/0168-0072(94)00061-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On NP-Completeness for Linear Machines

✍ Christine Gaßner 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 314 KB

Constant-only multiplicative linear logi

Constant-only multiplicative linear logic is NP-complete

✍ Patrick Lincoln; Timothy Winkler 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 959 KB

Some NP-complete problems in linear prog

Some NP-complete problems in linear programming

✍ R. Chandrasekaran; Santosh N. Kabadi; Katta G. Murthy 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 342 KB

On Some Completeness Theorems in Modal L

On Some Completeness Theorems in Modal Logic

✍ D. Makinson 📂 Article 📅 1966 🏛 John Wiley and Sons 🌐 English ⚖ 369 KB

ON SOME COMPLETENESS THEOREMS IN MODAL LOGIC1) by D. MAKINSON in Oxford (England)

A remark on NP-completeness of picture m

A remark on NP-completeness of picture matching

✍ Maurizio Tucci; Gennaro Costagliola; Shi-Kuo Chang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 359 KB

On the np-completeness of certain networ

On the np-completeness of certain network testing problems

✍ S. Even; O. Goldreich; S. Moran; P. Tong 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 946 KB

Let G ( V , E) be an undirected graph which describes the structure of a communication network. During the maintenance period every line must be tested in each of the two possible directions. A line is tested by assigning one of its endpoints t o be a transmitter, the other to be a receiver, and sen