( en | de | ru )

 

Disambiguation of "Seto, Kazuhisa"

Author of the publication

copydeleteadd this publication to your clipboard
A Satisfiability Algorithm for Deterministic Width-2 Branching Programs.

, , , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 105-A (9): 1298-1308 (September 2022)

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.

Jong Seto

Kazuhisa Kakurai

Mohamed Kamal Morsi Setouhi

Setotaw Ferede Tesema

 

Other publications of authors with the same name

A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis., and . CCC, page 107-116. IEEE Computer Society, (2012)A Moderately Exponential Time Algorithm for k-IBDD Satisfiability., , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 554-565. Springer, (2015)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)Internal Longest Palindrome Queries in Optimal Time., , , and . WALCOM, volume 13973 of Lecture Notes in Computer Science, page 127-138. Springer, (2023)Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover., , , , and . AAAI, page 20726-20734. AAAI Press, (2024)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)Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs., , , , , , and . IEICE Trans. Inf. Syst., 107 (6): 732-740 (2024)Shortest Cover After Edit., , , and . CPM, volume 296 of LIPIcs, page 24:1-24:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)A Moderately Exponential Time Algorithm for k-IBDD Satisfiability., , and . Algorithmica, 80 (10): 2725-2741 (2018)