 | 2011 |
|---|
| 18 |       | Kazuhisa Makino,
Suguru Tamaki,
Masaki Yamamoto:
Derandomizing HSSW Algorithm for 3-SAT.
COCOON 2011: 1-12 |
| 17 | | Kazuhisa Makino,
Suguru Tamaki,
Masaki Yamamoto:
Derandomizing HSSW Algorithm for 3-SAT
CoRR abs/1102.3766: (2011) |
| 16 | | Kazuhisa Makino,
Suguru Tamaki,
Masaki Yamamoto:
An exact algorithm for the Boolean connectivity problem for k-CNF.
Theor. Comput. Sci. 412(35): 4613-4618 (2011) |
| 2010 |
|---|
| 15 | | Suguru Tamaki,
Yuichi Yoshida:
A Query Efficient Non-adaptive Long Code Test with Perfect Completeness.
APPROX-RANDOM 2010: 738-751 |
| 14 | | Kazuo Iwama,
Kazuhisa Seto,
Tadashi Takai,
Suguru Tamaki:
Improved Randomized Algorithms for 3-SAT.
ISAAC (1) 2010: 73-84 |
| 13 | | Kazuhisa Makino,
Suguru Tamaki,
Masaki Yamamoto:
An Exact Algorithm for the Boolean Connectivity Problem for k-CNF.
SAT 2010: 172-180 |
| 12 | | Kazuhisa Makino,
Suguru Tamaki,
Masaki Yamamoto:
On the Boolean connectivity problem for Horn relations.
Discrete Applied Mathematics 158(18): 2024-2030 (2010) |
| 11 | | Kazuo Iwama,
Kazuhisa Seto,
Suguru Tamaki:
The Planar Hajós Calculus for Bounded Degree Graphs.
IEICE Transactions 93-A(6): 1000-1007 (2010) |
| 10 | | Kazuo Iwama,
Kazuhisa Seto,
Suguru Tamaki:
The complexity of the Hajós calculus for planar graphs.
Theor. Comput. Sci. 411(7-9): 1182-1191 (2010) |
| 2009 |
|---|
| 9 | | Suguru Tamaki,
Yuichi Yoshida:
A Query Efficient Non-Adaptive Long Code Test with Perfect Completeness.
Electronic Colloquium on Computational Complexity (ECCC) 16: 74 (2009) |
| 2008 |
|---|
| 8 | | Kazuo Iwama,
Suguru Tamaki:
The Complexity of the Hajos Calculus for Planar Graphs.
Electronic Colloquium on Computational Complexity (ECCC) 15(011): (2008) |
| 7 | | Youichi Hanatani,
Takashi Horiyama,
Kazuo Iwama,
Suguru Tamaki:
New Graph Calculi for Planar Non-3-Colorable Graphs.
IEICE Transactions 91-A(9): 2301-2307 (2008) |
| 2007 |
|---|
| 6 | | Kazuhisa Makino,
Suguru Tamaki,
Masaki Yamamoto:
On the Boolean Connectivity Problem for Horn Relations.
SAT 2007: 187-200 |
| 5 | | Kazuo Iwama,
Suguru Tamaki:
Exploiting partial knowledge of satisfying assignments.
Discrete Applied Mathematics 155(12): 1596-1603 (2007) |
| 4 | | Kazuhisa Makino,
Suguru Tamaki,
Masaki Yamamoto:
A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem.
Electronic Colloquium on Computational Complexity (ECCC) 14(029): (2007) |
| 2004 |
|---|
| 3 | | Kazuo Iwama,
Suguru Tamaki:
Improved upper bounds for 3-SAT.
SODA 2004: 328 |
| 2003 |
|---|
| 2 | | Kazuo Iwama,
Suguru Tamaki:
Improved Upper Bounds for 3-SAT
Electronic Colloquium on Computational Complexity (ECCC)(053): (2003) |
| 2001 |
|---|
| 1 | | Kazuo Iwama,
Suguru Tamaki:
Exploiting Partial Knowledge of Satisfying Assignments.
Algorithm Engineering 2001: 118-128 |
Data released under the ODC-BY 1.0 license — See also our legal information page