Kazuhisa Seto

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Optimal LZ-end parsing is hard2024-10-21Paper
Internal longest palindrome queries in optimal time
Lecture Notes in Computer Science
2023-11-24Paper
Finding top-\(k\) longest palindromes in substrings
Theoretical Computer Science
2023-10-26Paper
Satisfiability algorithm for syntactic read-\(k\)-times branching programs
Theory of Computing Systems
2021-06-11Paper
Satisfiability algorithm for syntactic read-\(k\)-times branching programs2020-11-25Paper
An Introduction to Lower Bounds on Resolution Proof Systems
Interdisciplinary Information Sciences
2020-11-19Paper
Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression
Journal of Computer and System Sciences
2019-08-07Paper
A moderately exponential time algorithm for \(k\)-IBDD satisfiability
Algorithmica
2018-07-26Paper
Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression2018-03-21Paper
Improved exact algorithms for mildly sparse instances of MAX SAT2017-09-29Paper
Improved exact algorithms for mildly sparse instances of MAX SAT
Theoretical Computer Science
2017-09-28Paper
Solving sparse instances of Max SAT via width reduction and greedy restriction
Theory of Computing Systems
2016-01-28Paper
A moderately exponential time algorithm for \(k\)-IBDD satisfiability
Lecture Notes in Computer Science
2015-10-30Paper
Solving sparse instances of Max SAT via width reduction and greedy restriction
Lecture Notes in Computer Science
2014-09-26Paper
Efficient algorithms for sorting \(k\)-sets in bins
Algorithms and Computation
2014-02-18Paper
A satisfiability algorithm and average-case hardness for formulas over the full binary basis
Computational Complexity
2013-07-19Paper
Improved randomized algorithms for 3-SAT
Algorithms and Computation
2010-12-09Paper
The complexity of the Hajós calculus for planar graphs
Theoretical Computer Science
2010-03-09Paper


Research outcomes over time


This page was built for person: Kazuhisa Seto