( en | de | ru )

 

Disambiguation of "Seto, Kazuhisa"

Author of the publication

copydeleteadd this publication to your clipboard
Improved Randomized Algorithms for 3-SAT.

, , , and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 73-84. Springer, (2010)

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 Moderately Exponential Time Algorithm for k-IBDD Satisfiability., , and . Algorithmica, 80 (10): 2725-2741 (2018)Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression., , , and . MFCS, volume 58 of LIPIcs, page 82:1-82:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Improved Randomized Algorithms for 3-SAT., , , and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 73-84. Springer, (2010)A Satisfiability Algorithm for Deterministic Width-2 Branching Programs., , , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 105-A (9): 1298-1308 (September 2022)Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs., , and . ISAAC, volume 92 of LIPIcs, page 58:1-58:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Optimal LZ-End Parsing Is Hard., , , , , and . CPM, volume 259 of LIPIcs, page 3:1-3:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)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)