
Search the dblp DataBase
Suguru Tamaki:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Kazuo Iwama, Suguru Tamaki
Improved upper bounds for 3SAT. [Citation Graph (0, 0)][DBLP] SODA, 2004, pp:328 [Conf]
 Kazuo Iwama, Suguru Tamaki
Exploiting Partial Knowledge of Satisfying Assignments. [Citation Graph (0, 0)][DBLP] Algorithm Engineering, 2001, pp:118128 [Conf]
 Kazuo Iwama, Suguru Tamaki
Improved Upper Bounds for 3SAT [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:053, pp: [Journal]
 Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
On the Boolean Connectivity Problem for Horn Relations. [Citation Graph (0, 0)][DBLP] SAT, 2007, pp:187200 [Conf]
 Kazuo Iwama, Suguru Tamaki
Exploiting partial knowledge of satisfying assignments. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:12, pp:15961603 [Journal]
A Query Efficient Nonadaptive Long Code Test with Perfect Completeness. [Citation Graph (, )][DBLP]
An Exact Algorithm for the Boolean Connectivity Problem for kCNF. [Citation Graph (, )][DBLP]
The Complexity of the Hajos Calculus for Planar Graphs. [Citation Graph (, )][DBLP]
A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
