LFCS 1997 Logical Foundations of Computer Science
 |  |
Wall of Fame | Most Viewed LFCS-1997 Paper
LFCS
1997
Springer
14 years 3 months ago
1997
Springer
The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various definitions of concurrency proposed in [2] and establish t...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 120 | ||
| 2 | | 96 | ||
| 3 | | 94 | ||
| 4 | | 82 |