Travelled to:1 × Austria
1 × Portugal
1 × United Kingdom
Collaborated with:K.Makino M.Yamamoto T.Sakai K.Seto
Talks about:problem (2) connect (2) boolean (2) algorithm (1) restrict (1) instanc (1) reduct (1) greedi (1) width (1) spars (1)
Person: Suguru Tamaki
DBLP: Tamaki:Suguru
Contributed to:
201420102007Wrote 3 papers:
- SAT-2014-SakaiST #reduction #satisfiability #strict
- Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction (TS, KS, ST), pp. 32–47.
- SAT-2010-MakinoTY #algorithm #problem
- An Exact Algorithm for the Boolean Connectivity Problem for k-CNF (KM, ST, MY), pp. 172–180.
- SAT-2007-MakinoTY #on the #problem
- On the Boolean Connectivity Problem for Horn Relations (KM, ST, MY), pp. 187–200.