( en | de | ru )

 

Disambiguation of "Tamaki, Suguru"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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

Robust Approximation of Temporal CSP., and . APPROX-RANDOM, volume 28 of LIPIcs, page 419-432. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)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)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)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)On Computing a Center Persistence Diagram., , , , , , and . FCT, volume 14292 of Lecture Notes in Computer Science, page 262-275. Springer, (2023)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)Beating Grover search for low-energy estimation and state preparation., , , , , and . CoRR, (2024)Gate elimination: Circuit size lower bounds and #SAT upper bounds., , , and . Theor. Comput. Sci., (2018)Quantum Query Complexity of Unitary Operator Discrimination., , , and . COCOON, volume 10392 of Lecture Notes in Computer Science, page 309-320. Springer, (2017)On the Boolean Connectivity Problem for Horn Relations., , and . SAT, volume 4501 of Lecture Notes in Computer Science, page 187-200. Springer, (2007)