Suguru Tamaki

Linear programming, width-1 CSPs, and robust satisfaction

Gábor Kun, Ryan O’Donnell, Suguru Tamaki et al. · 2012 · 56 citations

Mathematical Programming, Engineering, Computational Complexity +18

Beating Brute Force for Systems of Polynomial Equations over Finite Fields

Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki et al. · 2017 · 40 citations · Full text

A satisfiability algorithm and average-case hardness for formulas over the full binary basis

K. Seto, Suguru Tamaki · Computational Complexity · 2013 · 34 citations

Satisfiability Algorithm, Engineering, Computational Complexity Theory +13

An exact algorithm for the Boolean connectivity problem for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-CNF

Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto · Theoretical Computer Science · 2011 · 28 citations

Math Xmlns, Computational Complexity Theory, Engineering +8

A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis

K. Seto, Suguru Tamaki · 2012 · 17 citations

Computational Complexity Theory, Engineering, Computational Complexity +19