DIS 2000 IEEE Workshop on Distributed Intelligent Systems: Collective Intelligence and Its Applications
 |  |
Wall of Fame | Most Viewed DIS-2000 Paper
DIS
2000
Springer
13 years 9 months ago
2000
Springer
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
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 |  | 112 | ||
| 2 | | 107 | ||
| 3 | | 92 | ||
| 4 | | 91 | ||
| 5 | | 67 | ||
| 6 | | 65 | ||
| 7 | | 64 |