The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Suguru Tamaki" ( http://dblp.L3S.de/Authors/Suguru_Tamaki )

URL (Homepage):  http://www.lab2.kuis.kyoto-u.ac.jp/~tamak/index.html  Author page on DBLP  Author page in RDF  Community of Suguru Tamaki in ASPL-2

Publication years (Num. hits)
2001-2010 (15) 2011-2015 (16) 2016-2019 (19)
Publication types (Num. hits)
article(32) inproceedings(18)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 51 publication records. Showing 50 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Akinori Kawachi, Kenichi Kawano, Francois Le Gall, Suguru Tamaki Quantum Query Complexity of Unitary Operator Discrimination. Search on Bibsonomy IEICE Transactions The full citation details ... 2019 DBLP  BibTeX  RDF
1Tomoyuki Morimae, Suguru Tamaki Fine-grained quantum computational supremacy. Search on Bibsonomy Quantum Information & Computation The full citation details ... 2019 DBLP  BibTeX  RDF
1Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tomoyuki Morimae, Suguru Tamaki Fine-grained quantum computational supremacy. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Yasuaki Kobayashi, Yusuke Kobayashi 0001, Shuichi Miyazaki, Suguru Tamaki An FPT Algorithm for Max-Cut Parameterized by Crossing Number. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu On Computing a Center Persistence Diagram. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Tomoyuki 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. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Yasuaki Kobayashi, Yusuke Kobayashi 0001, Shuichi Miyazaki, Suguru Tamaki An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. Search on Bibsonomy IWOCA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Suguru Tamaki, Yuichi Yoshida Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki Gate elimination: Circuit size lower bounds and #SAT upper bounds. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama Improved exact algorithms for mildly sparse instances of Max SAT. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Suguru Tamaki, Osamu Watanabe 0001 Local Restrictions from the Furst-Saxe-Sipser Paper. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, R. Ryan Williams, Huacheng Yu Beating Brute Force for Systems of Polynomial Equations over Finite Fields. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Akinori Kawachi, Kenichi Kawano, François Le Gall, Suguru Tamaki Quantum Query Complexity of Unitary Operator Discrimination. Search on Bibsonomy COCOON The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2016 DBLP  BibTeX  RDF
1Suguru Tamaki A Satisfiability Algorithm for Depth Two Circuits with a Sub-Quadratic Number of Symmetric and Threshold Gates. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2016 DBLP  BibTeX  RDF
1Alexander Golovnev, Alexander S. Kulikov, Alexander Smal, Suguru Tamaki Circuit size lower bounds and #SAT upper bounds through a general framework. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2016 DBLP  BibTeX  RDF
1Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. Search on Bibsonomy MFCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework. Search on Bibsonomy MFCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Takayuki 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. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2015 DBLP  BibTeX  RDF
1Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Suguru Tamaki, Yuichi Yoshida A query efficient non-adaptive long code test with perfect completeness. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama Improved Exact Algorithms for Mildly Sparse Instances of Max SAT. Search on Bibsonomy IPEC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Suguru Tamaki, Yuichi Yoshida Robust Approximation of Temporal CSP. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2014 DBLP  BibTeX  RDF
1Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction. Search on Bibsonomy SAT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Suguru Tamaki, Yuichi Yoshida Robust Approximation of Temporal CSP. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Kazuhisa Seto, Suguru Tamaki A satisfiability algorithm and average-case hardness for formulas over the full binary basis. Search on Bibsonomy Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001 Derandomizing the HSSW Algorithm for 3-SAT. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Kazuhisa Seto, Suguru Tamaki A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Gábor Kun, Ryan O'Donnell, Suguru Tamaki, Yuichi Yoshida, Yuan Zhou 0007 Linear programming, width-1 CSPs, and robust satisfaction. Search on Bibsonomy ITCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Suguru Tamaki, Yuichi Yoshida Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Kazuhisa Seto, Suguru Tamaki A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001 An exact algorithm for the Boolean connectivity problem for k-CNF. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001 Derandomizing HSSW Algorithm for 3-SAT Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001 Derandomizing HSSW Algorithm for 3-SAT. Search on Bibsonomy COCOON The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki The Planar Hajós Calculus for Bounded Degree Graphs. Search on Bibsonomy IEICE Transactions The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki The complexity of the Hajós calculus for planar graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001 On the Boolean connectivity problem for Horn relations. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki Improved Randomized Algorithms for 3-SAT. Search on Bibsonomy ISAAC (1) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001 An Exact Algorithm for the Boolean Connectivity Problem for k-CNF. Search on Bibsonomy SAT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Suguru Tamaki, Yuichi Yoshida A Query Efficient Non-adaptive Long Code Test with Perfect Completeness. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Suguru Tamaki, Yuichi Yoshida A Query Efficient Non-Adaptive Long Code Test with Perfect Completeness. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Youichi Hanatani, Takashi Horiyama, Kazuo Iwama, Suguru Tamaki New Graph Calculi for Planar Non-3-Colorable Graphs. Search on Bibsonomy IEICE Transactions The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Kazuo Iwama, Suguru Tamaki The Complexity of the Hajos Calculus for Planar Graphs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2008 DBLP  BibTeX  RDF
1Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001 A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Kazuo Iwama, Suguru Tamaki Exploiting partial knowledge of satisfying assignments. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001 On the Boolean Connectivity Problem for Horn Relations. Search on Bibsonomy SAT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Kazuo Iwama, Suguru Tamaki Improved upper bounds for 3-SAT. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
1Kazuo Iwama, Suguru Tamaki Improved Upper Bounds for 3-SAT Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2003 DBLP  BibTeX  RDF
1Kazuo Iwama, Suguru Tamaki Exploiting Partial Knowledge of Satisfying Assignments. Search on Bibsonomy Algorithm Engineering The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #50 of 50 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license