default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSuguru Tamaki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i16]Harry Buhrman, Sevag Gharibian, Zeph Landau, François Le Gall, Norbert Schuch, Suguru Tamaki:
Beating Grover search for low-energy estimation and state preparation. CoRR abs/2407.03073 (2024)- 2023
- [c19]Yuya Higashikawa, Naoki Katoh, Guohui Lin
, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu:
On Computing a Center Persistence Diagram. FCT 2023: 262-275 - 2022
- [j19]Suguru Tamaki:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(9): 1180 (2022) - 2020
- [j18]Tomoyuki Morimae, Suguru Tamaki:
Additive-error fine-grained quantum supremacy. Quantum 4: 329 (2020)
2010 – 2019
- 2019
- [j17]Akinori Kawachi, Kenichi Kawano, Francois Le Gall, Suguru Tamaki:
Quantum Query Complexity of Unitary Operator Discrimination. IEICE Trans. Inf. Syst. 102-D(3): 483-491 (2019) - [j16]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression. J. Comput. Syst. Sci. 105: 87-103 (2019) - [j15]Tomoyuki Morimae, Suguru Tamaki:
Fine-grained quantum computational supremacy. Quantum Inf. Comput. 19(13&14): 1089-1115 (2019) - [c18]Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki:
An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. IWOCA 2019: 327-338 - [i15]Tomoyuki Morimae, Suguru Tamaki:
Fine-grained quantum computational supremacy. CoRR abs/1901.01637 (2019) - [i14]Tomoyuki Morimae, Suguru Tamaki:
Depth-scaling fine-grained quantum supremacy based on SETH and qubit-scaling fine-grained quantum supremacy based on Orthogonal Vectors and 3-SUM. CoRR abs/1902.08382 (2019) - [i13]Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki:
An FPT Algorithm for Max-Cut Parameterized by Crossing Number. CoRR abs/1904.05011 (2019) - [i12]Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu:
On Computing a Center Persistence Diagram. CoRR abs/1910.01753 (2019) - 2018
- [j14]Suguru Tamaki, Yuichi Yoshida:
Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues. ACM Trans. Algorithms 14(4): 45:1-45:13 (2018) - [j13]Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki:
Gate elimination: Circuit size lower bounds and #SAT upper bounds. Theor. Comput. Sci. 719: 46-63 (2018) - 2017
- [j12]Suguru Tamaki, Osamu Watanabe:
Local Restrictions from the Furst-Saxe-Sipser Paper. Theory Comput. Syst. 60(1): 20-32 (2017) - [j11]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
Improved exact algorithms for mildly sparse instances of Max SAT. Theor. Comput. Sci. 697: 58-68 (2017) - [c17]Akinori Kawachi, Kenichi Kawano, François Le Gall, Suguru Tamaki:
Quantum Query Complexity of Unitary Operator Discrimination. COCOON 2017: 309-320 - [c16]Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, R. Ryan Williams, Huacheng Yu:
Beating Brute Force for Systems of Polynomial Equations over Finite Fields. SODA 2017: 2190-2202 - 2016
- [c15]Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki:
Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework. MFCS 2016: 45:1-45:16 - [c14]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. MFCS 2016: 82:1-82:16 - [i11]Alexander Golovnev, Alexander S. Kulikov, Alexander Smal, Suguru Tamaki:
Circuit size lower bounds and #SAT upper bounds through a general framework. Electron. Colloquium Comput. Complex. TR16 (2016) - [i10]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. Electron. Colloquium Comput. Complex. TR16 (2016) - [i9]Suguru Tamaki:
A Satisfiability Algorithm for Depth Two Circuits with a Sub-Quadratic Number of Symmetric and Threshold Gates. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j10]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki:
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction. Theory Comput. Syst. 57(2): 426-443 (2015) - [j9]Suguru Tamaki, Yuichi Yoshida:
A query efficient non-adaptive long code test with perfect completeness. Random Struct. Algorithms 47(2): 386-406 (2015) - [c13]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
Improved Exact Algorithms for Mildly Sparse Instances of Max SAT. IPEC 2015: 90-101 - [i8]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
A Satisfiability Algorithm for Depth-2 Circuits with a Symmetric Gate at the Top and AND Gates at the Bottom. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c12]Suguru Tamaki, Yuichi Yoshida:
Robust Approximation of Temporal CSP. APPROX-RANDOM 2014: 419-432 - [c11]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki:
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction. SAT 2014: 32-47 - [i7]Suguru Tamaki, Yuichi Yoshida:
Robust Approximation of Temporal CSP. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j8]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
Derandomizing the HSSW Algorithm for 3-SAT. Algorithmica 67(2): 112-124 (2013) - [j7]Kazuhisa Seto, Suguru Tamaki:
A satisfiability algorithm and average-case hardness for formulas over the full binary basis. Comput. Complex. 22(2): 245-274 (2013) - 2012
- [c10]Suguru Tamaki, Yuichi Yoshida:
Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues. APPROX-RANDOM 2012: 313-324 - [c9]Kazuhisa Seto, Suguru Tamaki:
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis. CCC 2012: 107-116 - [c8]Gábor Kun, Ryan O'Donnell, Suguru Tamaki, Yuichi Yoshida, Yuan Zhou:
Linear programming, width-1 CSPs, and robust satisfaction. ITCS 2012: 484-495 - [i6]Kazuhisa Seto, Suguru Tamaki:
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j6]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
An exact algorithm for the Boolean connectivity problem for k-CNF. Theor. Comput. Sci. 412(35): 4613-4618 (2011) - [c7]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
Derandomizing HSSW Algorithm for 3-SAT. COCOON 2011: 1-12 - [i5]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
Derandomizing HSSW Algorithm for 3-SAT. CoRR abs/1102.3766 (2011) - 2010
- [j5]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
On the Boolean connectivity problem for Horn relations. Discret. Appl. Math. 158(18): 2024-2030 (2010) - [j4]Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki:
The Planar Hajós Calculus for Bounded Degree Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(6): 1000-1007 (2010) - [j3]Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki:
The complexity of the Hajós calculus for planar graphs. Theor. Comput. Sci. 411(7-9): 1182-1191 (2010) - [c6]Suguru Tamaki, Yuichi Yoshida:
A Query Efficient Non-adaptive Long Code Test with Perfect Completeness. APPROX-RANDOM 2010: 738-751 - [c5]Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki:
Improved Randomized Algorithms for 3-SAT. ISAAC (1) 2010: 73-84 - [c4]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
An Exact Algorithm for the Boolean Connectivity Problem for k-CNF. SAT 2010: 172-180
2000 – 2009
- 2009
- [i4]Suguru Tamaki, Yuichi Yoshida:
A Query Efficient Non-Adaptive Long Code Test with Perfect Completeness. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j2]Youichi Hanatani, Takashi Horiyama, Kazuo Iwama, Suguru Tamaki:
New Graph Calculi for Planar Non-3-Colorable Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(9): 2301-2307 (2008) - [i3]Kazuo Iwama, Suguru Tamaki:
The Complexity of the Hajos Calculus for Planar Graphs. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j1]Kazuo Iwama, Suguru Tamaki:
Exploiting partial knowledge of satisfying assignments. Discret. Appl. Math. 155(12): 1596-1603 (2007) - [c3]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
On the Boolean Connectivity Problem for Horn Relations. SAT 2007: 187-200 - [i2]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem. Electron. Colloquium Comput. Complex. TR07 (2007) - 2004
- [c2]Kazuo Iwama, Suguru Tamaki:
Improved upper bounds for 3-SAT. SODA 2004: 328 - 2003
- [i1]Kazuo Iwama, Suguru Tamaki:
Improved Upper Bounds for 3-SAT. Electron. Colloquium Comput. Complex. TR03 (2003) - 2001
- [c1]Kazuo Iwama, Suguru Tamaki:
Exploiting Partial Knowledge of Satisfying Assignments. WAE 2001: 118-128
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 19:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
