| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8902923 | Discrete Mathematics | 2018 | 6 Pages |
Abstract
From a computational perspective, a polynomial number of independent sets is particularly interesting. Our results lead to polynomial algorithms for restricted instances of many problems including Set Cover and k-SAT.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Nikola Yolov,