Följ
Kazuhisa Seto
Kazuhisa Seto
Verifierad e-postadress på ist.hokudai.ac.jp
Titel
Citeras av
Citeras av
År
A satisfiability algorithm and average-case hardness for formulas over the full binary basis
K Seto, S Tamaki
computational complexity 22 (2), 245-274, 2013
312013
Improved randomized algorithms for 3-SAT
K Iwama, K Seto, T Takai, S Tamaki
Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju …, 2010
272010
A satisfiability algorithm and average-case hardness for formulas over the full binary basis
K Seto, S Tamaki
2012 IEEE 27th Conference on Computational Complexity, 107-116, 2012
202012
Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression
T Sakai, K Seto, S Tamaki, J Teruyama
Journal of Computer and System Sciences 105, 87-103, 2019
122019
Solving sparse instances of max SAT via width reduction and greedy restriction
T Sakai, K Seto, S Tamaki
Theory of Computing Systems 57, 426-443, 2015
102015
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability
A Nagao, K Seto, J Teruyama
Algorithmica 80, 2725-2741, 2018
92018
A satisfiability algorithm for depth-2 circuits with a symmetric gate at the top and AND gates at the bottom
T Sakai, K Seto, S Tamaki, J Teruyama
Electronic Colloquium on Computational Complexity (ECCC) 22, 136, 2015
82015
Optimal LZ-end parsing is hard
H Bannai, M Funakoshi, K Kurita, Y Nakashima, K Seto, T Uno
arXiv preprint arXiv:2302.02586, 2023
72023
The complexity of the Hajós calculus for planar graphs
K Iwama, K Seto, S Tamaki
Theoretical computer science 411 (7-9), 1182-1191, 2010
52010
Improved exact algorithms for mildly sparse instances of Max SAT
T Sakai, K Seto, S Tamaki, J Teruyama
Theoretical Computer Science 697, 58-68, 2017
42017
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs
A Nagao, K Seto, J Teruyama
Theory of Computing Systems 64, 1392-1407, 2020
32020
Internal Longest Palindrome Queries in Optimal Time
K Mitani, T Mieno, K Seto, T Horiyama
International Conference and Workshops on Algorithms and Computation, 127-138, 2023
12023
Efficient Algorithms for Sorting k-Sets in Bins
A Nagao, K Seto, J Teruyama
IEICE TRANSACTIONS on Information and Systems 98 (10), 1736-1743, 2015
12015
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover
T Horiyama, Y Kobayashi, H Ono, K Seto, R Suzuki
Proceedings of the AAAI Conference on Artificial Intelligence 38 (18), 20726 …, 2024
2024
Shortest cover after edit
K Mitani, T Mieno, K Seto, T Horiyama
arXiv preprint arXiv:2402.17428, 2024
2024
Finding top-k longest palindromes in substrings
K Mitani, T Mieno, K Seto, T Horiyama
Theoretical Computer Science 979, 114183, 2023
2023
Hardness of Computing a Pre-assignment to Uniquify Minimum Dominating Sets on Bipartite Graphs
R SUZUKI, K SETO, T HORIYAMA
情報処理学会研究報告 (Web) 2023 (AL-195), 2023
2023
A Satisfiability Algorithm for Deterministic Width-2 Branching Programs
T Makita, A Nagao, T Okada, K Seto, J Teruyama
IEICE Transactions on Fundamentals of Electronics, Communications and …, 2022
2022
Improved Analysis of Greedy Algorithm for Sorting k-Sets in Bins
K Shimizu, T Mitsuhashi, K Seto
IEICE Technical Report; IEICE Tech. Rep. 116 (503), 29-32, 2017
2017
An Exact Algorithm for the Satisfiability of Depth-2 SYM-AND Circuits
脊戸和寿, 玉置卓, 照山順一
電子情報通信学会技術研究報告= IEICE technical report: 信学技報 116 (262), 29-34, 2016
2016
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20