Kazuhisa Seto

Most-cited papers

A satisfiability algorithm and average-case hardness for formulas over the full binary basis
Kazuhisa Seto, Suguru Tamaki
2012Computational Complexity52 citations Open access
Semantic Scholar
Improved Randomized Algorithms for 3-SAT
K. Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki
2010International Symposium on Algorithms and Computation23 citations
Semantic Scholar
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
2019International Symposium on Mathematical Foundations of Computer Science13 citations Open access
Semantic Scholar
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2015Algorithmica9 citations
Semantic Scholar
A Satisfiability Algorithm for Depth-2 Circuits with a Symmetric Gate at the Top and AND Gates at the Bottom
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
2015Electron. Colloquium Comput. Complex.7 citations
Semantic Scholar
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki
2014Theory of Computing Systems7 citations
Semantic Scholar
The complexity of the Hajós calculus for planar graphs
K. Iwama, Kazuhisa Seto, Suguru Tamaki
2010Theoretical Computer Science6 citations Open access
Semantic Scholar
Finding top-k longest palindromes in substrings
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
2022Theoretical Computer Science5 citations Open access
Semantic Scholar
Improved exact algorithms for mildly sparse instances of Max SAT
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
2017Theoretical Computer Science5 citations Open access
Semantic Scholar
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2020Theory of Computing Systems3 citations Open access
Semantic Scholar
Internal Longest Palindrome Queries in Optimal Time
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
2023Workshop on Algorithms and Computation2 citations Open access
Semantic Scholar
Optimal LZ-End Parsing is Hard
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima +2 more
2023Annual Symposium on Combinatorial Pattern Matching2 citations Open access
Semantic Scholar
Efficient Algorithms for Sorting k-Sets in Bins
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2014Workshop on Algorithms and Computation1 citations Open access
Semantic Scholar
Efficient Algorithms for Sorting $k$-Sets in Bins
Kazuhisa Seto, Teruyama Junichi, Atsuki Nagao
20131 citations
Semantic Scholar
The Complexity of Boolean Connectivity Problem of $k$-Horn Formulas
Takashi Horiyama, Shoon Mineyoshi, Yuto Okura, Kazuhisa Seto +1 more
20260 citations
Semantic Scholar
A Satisfiability Algorithm for Deterministic Width-2 Branching Programs
Tomu Makita, Atsuki Nagao, Tatsuki Okada, Kazuhisa Seto +1 more
2022IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences0 citations Open access
Semantic Scholar
An Exact Algorithm for the Satisfiability of Depth-2 SYM-AND Circuits.
Kazuhisa Seto, Suguru Tamaki, Teruyama Junichi
20160 citations
Semantic Scholar
An Exact Algorithm for Oblivious Read-Twice Branching Program Satisfiability
Kazuhisa Seto, Junichi Teruyama
2016IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences0 citations
Semantic Scholar
An Introduction to Lower Bounds on Resolution Proof Systems
Kazuhisa Seto
20150 citations Open access
Semantic Scholar
The Planar Hajós Calculus for Bounded Degree Graphs
K. Iwama, Kazuhisa Seto, Suguru Tamaki
2010IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences0 citations
Semantic Scholar
DS-1-4 Enumerating Non-3-colorable Planar Graphs by the Hajos Calculus
K. Iwama, Kazuhisa Seto, Suguru Tamaki
20100 citations
Semantic Scholar