Kazuhisa Seto

From MaRDI portal
Person:354653

Available identifiers

zbMath Open seto.kazuhisaMaRDI QIDQ354653

List of research outcomes





PublicationDate of PublicationType
Optimal LZ-end parsing is hard2024-10-21Paper
Internal longest palindrome queries in optimal time2023-11-24Paper
Finding top-\(k\) longest palindromes in substrings2023-10-26Paper
Satisfiability algorithm for syntactic read-\(k\)-times branching programs2021-06-11Paper
Satisfiability algorithm for syntactic read-\(k\)-times branching programs2020-11-25Paper
An Introduction to Lower Bounds on Resolution Proof Systems2020-11-19Paper
Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression2019-08-07Paper
A moderately exponential time algorithm for \(k\)-IBDD satisfiability2018-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 SAT2017-09-28Paper
Solving sparse instances of Max SAT via width reduction and greedy restriction2016-01-28Paper
A moderately exponential time algorithm for \(k\)-IBDD satisfiability2015-10-30Paper
Solving sparse instances of Max SAT via width reduction and greedy restriction2014-09-26Paper
Efficient algorithms for sorting \(k\)-sets in bins2014-02-18Paper
A satisfiability algorithm and average-case hardness for formulas over the full binary basis2013-07-19Paper
Improved randomized algorithms for 3-SAT2010-12-09Paper
The complexity of the Hajós calculus for planar graphs2010-03-09Paper

Research outcomes over time

This page was built for person: Kazuhisa Seto