| |
| 2008 | ||
|---|---|---|
| 2 | EE | Tianyan Deng, Daoyun Xu: NP-Completeness of (k-SAT, r-UNk-SAT) and (LSAT>=k, r-UNLSAT>=k). FAW 2008: 79-88 |
| 1 | EE | Tianyan Deng, Daoyun Xu: Hardness of Approximation Algorithms on k-SAT and (k, s)-SAT Problems. ICYCS 2008: 60-64 |
| 1 | Daoyun Xu | [1] [2] |