 | 2008 |
|---|
| 7 |       | Tianyan Deng,
Daoyun Xu:
NP-Completeness of (k-SAT, r-UNk-SAT) and (LSAT>=k, r-UNLSAT>=k).
FAW 2008: 79-88 |
| 6 | | Tianyan Deng,
Daoyun Xu:
Hardness of Approximation Algorithms on k-SAT and (k, s)-SAT Problems.
ICYCS 2008: 60-64 |
| 2007 |
|---|
| 5 | | Qingshun Zhang,
Daoyun Xu:
The Existence of Unsatisfiable Formulas in k-LCNF for k>=3.
TAMC 2007: 616-623 |
| 2006 |
|---|
| 4 | | Ping Gong,
Daoyun Xu:
A New Lower Bound of Critical Function for (k, s)-SAT.
TAMC 2006: 274-282 |
| 2005 |
|---|
| 3 | | Hans Kleine Büning,
Daoyun Xu:
The complexity of homomorphisms and renamings for minimal unsatisfiable formulas.
Ann. Math. Artif. Intell. 43(1): 113-127 (2005) |
| 2 | | Daoyun Xu,
Zhi-Hong Tao:
Complexities of Homomorphism and Isomorphism for Definite Logic Programs.
J. Comput. Sci. Technol. 20(6): 758-762 (2005) |
| 2003 |
|---|
| 1 | | Daoyun Xu,
Decheng Ding,
Zhang Mingyi:
Characterization of an Auto-Compatible Default Theory.
J. Comput. Sci. Technol. 18(3): 393-398 (2003) |
