MFCS   2010 International Symposium on Mathematical Foundations of Computer
Wall of Fame | Most Viewed MFCS-2010 Paper
12 years 10 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...
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.
1Download preprint from source249
2Download preprint from source181
3Download preprint from source177
4Download preprint from source176
5Download preprint from source172
6Download preprint from source169
7Download preprint from source162
8Download preprint from source159
9Download preprint from source155
10Download preprint from source154
11Download preprint from source152
12Download preprint from source149
13Download preprint from source145
14Download preprint from source145
15Download preprint from source140
16Download preprint from source139
17Download preprint from source129
18Download preprint from source127
19Download preprint from source127
20Download preprint from source125
21Download preprint from source123
22Download preprint from source121
23Download preprint from source111
24Download preprint from source105