| |
| 2007 | ||
|---|---|---|
| 5 | EE | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto: On the Boolean Connectivity Problem for Horn Relations. SAT 2007: 187-200 |
| 4 | EE | Kazuo Iwama, Suguru Tamaki: Exploiting partial knowledge of satisfying assignments. Discrete Applied Mathematics 155(12): 1596-1603 (2007) |
| 2004 | ||
| 3 | EE | Kazuo Iwama, Suguru Tamaki: Improved upper bounds for 3-SAT. SODA 2004: 328 |
| 2003 | ||
| 2 | EE | Kazuo Iwama, Suguru Tamaki: Improved Upper Bounds for 3-SAT Electronic Colloquium on Computational Complexity (ECCC)(053): (2003) |
| 2001 | ||
| 1 | EE | Kazuo Iwama, Suguru Tamaki: Exploiting Partial Knowledge of Satisfying Assignments. Algorithm Engineering 2001: 118-128 |
| 1 | Kazuo Iwama | [1] [2] [3] [4] |
| 2 | Kazuhisa Makino | [5] |
| 3 | Masaki Yamamoto | [5] |