关注
Suguru Tamaki
Suguru Tamaki
University of Hyogo
在 sis.u-hyogo.ac.jp 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Improved upper bounds for 3-SAT
K Iwama, S Tamaki
Proceedings of the 15th annual ACM-SIAM Symposium on Discrete Algorithms …, 2004
1562004
Beating brute force for systems of polynomial equations over finite fields
D Lokshtanov, R Paturi, S Tamaki, R Williams, H Yu
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
812017
Linear programming, width-1 CSPs, and robust satisfaction
G Kun, R O'Donnell, S Tamaki, Y Yoshida, Y Zhou
Proceedings of the 3rd Innovations in Theoretical Computer Science …, 2012
702012
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
492013
Derandomizing the HSSW Algorithm for 3-SAT
K Makino, S Tamaki, M Yamamoto
Algorithmica 67, 112-124, 2013
342013
A satisfiability algorithm for depth two circuits with a sub-quadratic number of symmetric and threshold gates
S Tamaki
Electronic Colloquium on Computational Complexity (ECCC) 23 (100), 100, 2016
302016
An exact algorithm for the Boolean connectivity problem for k-CNF
K Makino, S Tamaki, M Yamamoto
Theoretical Computer Science 412 (35), 4613-4618, 2011
302011
Improved randomized algorithms for 3-SAT
K Iwama, K Seto, T Takai, S Tamaki
Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju …, 2010
282010
On the Boolean connectivity problem for Horn relations
K Makino, S Tamaki, M Yamamoto
Discrete Applied Mathematics 158 (18), 2024-2030, 2010
232010
Fine-grained quantum computational supremacy
T Morimae, S Tamaki
Quantum Information and Computation 19 (13&14), 1089-1115, 2019
192019
A query efficient non‐adaptive long code test with perfect completeness
S Tamaki, Y Yoshida
Random Structures & Algorithms 47 (2), 386-406, 2015
17*2015
Gate Elimination: Circuit Size Lower Bounds and #SAT Upper Bounds
A Golovnev, AS Kulikov, AV Smal, S Tamaki
Theoretical Computer Science 719, 46-63, 2017
15*2017
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
Additive-error fine-grained quantum supremacy
T Morimae, S Tamaki
Quantum 4, 329, 2020
92020
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
Quantum query complexity of unitary operator discrimination
A Kawachi, K Kawano, F Le Gall, S Tamaki
IEICE TRANSACTIONS on Information and Systems 102 (3), 483-491, 2019
62019
An improved fixed-parameter algorithm for Max-Cut parameterized by crossing number
Y Kobayashi, Y Kobayashi, S Miyazaki, S Tamaki
Combinatorial Algorithms: 30th International Workshop, IWOCA 2019, Pisa …, 2019
62019
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
Fine-grained quantum supremacy based on orthogonal vectors, 3-sum and all-pairs shortest paths
R Hayakawa, T Morimae, S Tamaki
arXiv preprint arXiv:1902.08382, 2019
42019
系统目前无法执行此操作，请稍后再试。
文章 1–20