( en | de | ru )

 

Disambiguation of "Tamaki, Suguru"

Author of the publication

copydeleteadd this publication to your clipboard
Improved exact algorithms for mildly sparse instances of Max SAT.

, , , and . Theor. Comput. Sci., (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Tamaki, Suguru
add a person with the name Tamaki, Suguru
 

Other publications of authors with the same name

Derandomizing the HSSW Algorithm for 3-SAT., , and . Algorithmica, 67 (2): 112-124 (2013)A Satisfiability Algorithm for Depth-2 Circuits with a Symmetric Gate at the Top and AND Gates at the Bottom., , , and . Electron. Colloquium Comput. Complex., (2015)Improved Upper Bounds for 3-SAT, and . Electron. Colloquium Comput. Complex., (2003)An Exact Algorithm for the Boolean Connectivity Problem for k-CNF., , and . SAT, volume 6175 of Lecture Notes in Computer Science, page 172-180. Springer, (2010)Foreword.. IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 105-A (9): 1180 (September 2022)The complexity of the Hajós calculus for planar graphs., , and . Theor. Comput. Sci., 411 (7-9): 1182-1191 (2010)Robust Approximation of Temporal CSP., and . APPROX-RANDOM, volume 28 of LIPIcs, page 419-432. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)On Computing a Center Persistence Diagram., , , , , , and . FCT, volume 14292 of Lecture Notes in Computer Science, page 262-275. Springer, (2023)Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction., , and . SAT, volume 8561 of Lecture Notes in Computer Science, page 32-47. Springer, (2014)Improved Exact Algorithms for Mildly Sparse Instances of Max SAT., , , and . IPEC, volume 43 of LIPIcs, page 90-101. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)