( en | de | ru )

 

Disambiguation of "Seto, Kazuhisa"

Author of the publication

copydeleteadd this publication to your clipboard
Shortest cover after edit.

, , , and . CoRR, (2024)

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 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 and Average-Case Hardness for Formulas over the Full Binary Basis., and . CCC, page 107-116. IEEE Computer Society, (2012)Finding top-k longest palindromes in substrings., , , and . Theor. Comput. Sci., (November 2023)Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression., , , and . J. Comput. Syst. Sci., (2019)Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction., , and . Theory Comput. Syst., 57 (2): 426-443 (2015)Efficient Algorithms for Sorting k-Sets in Bins., , and . WALCOM, volume 8344 of Lecture Notes in Computer Science, page 225-236. Springer, (2014)A satisfiability algorithm and average-case hardness for formulas over the full binary basis., and . Comput. Complex., 22 (2): 245-274 (2013)The Planar Hajós Calculus for Bounded Degree Graphs., , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 93-A (6): 1000-1007 (2010)Improved exact algorithms for mildly sparse instances of Max SAT., , , and . Theor. Comput. Sci., (2017)A Moderately Exponential Time Algorithm for k-IBDD Satisfiability., , and . Algorithmica, 80 (10): 2725-2741 (2018)