Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Suguru
    Last name: Tamaki
    DBLP: 01/3717
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 39 of 39  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Suguru Tamaki, Osamu Watanabe 0001.
    Local Restrictions from the Furst-Saxe-Sipser Paper.
    Theory Comput. Syst. 2017, Volume 60 (0) 2017
    Conference paper
    Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, R. Ryan Williams, Huacheng Yu.
    Beating Brute Force for Systems of Polynomial Equations over Finite Fields.
    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19 2017 (0) 2017
    Conference paper
    Akinori Kawachi, Kenichi Kawano, François Le Gall, Suguru Tamaki.
    Quantum Query Complexity of Unitary Operator Discrimination.
    Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings 2017 (0) 2017
    Conference paper
    Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama.
    Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Suguru Tamaki.
    A Satisfiability Algorithm for Depth Two Circuits with a Sub-Quadratic Number of Symmetric and Threshold Gates.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama.
    Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression.
    41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland 2016 (0) 2016
    Conference paper
    Alexander Golovnev, Alexander S. Kulikov, Alexander Smal, Suguru Tamaki.
    Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework.
    41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland 2016 (0) 2016
    Conference paper
    Alexander Golovnev, Alexander S. Kulikov, Alexander Smal, Suguru Tamaki.
    Circuit size lower bounds and #SAT upper bounds through a general framework.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki.
    Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction.
    Theory Comput. Syst. 2015, Volume 57 (0) 2015
    Conference paper
    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.
    Electronic Colloquium on Computational Complexity (ECCC) 2015, Volume 22 (0) 2015
    Conference paper
    Suguru Tamaki, Yuichi Yoshida.
    A query efficient non-adaptive long code test with perfect completeness.
    Random Struct. Algorithms 2015, Volume 47 (0) 2015
    Conference paper
    Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama.
    Improved Exact Algorithms for Mildly Sparse Instances of Max SAT.
    10th International Symposium on Parameterized and Exact Computation, IPEC 2015, September 16-18, 2015, Patras, Greece 2015 (0) 2015
    Conference paper
    Suguru Tamaki, Yuichi Yoshida.
    Robust Approximation of Temporal CSP.
    Electronic Colloquium on Computational Complexity (ECCC) 2014, Volume 21 (0) 2014
    Conference paper
    Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki.
    Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction.
    Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings 2014 (0) 2014
    Conference paper
    Suguru Tamaki, Yuichi Yoshida.
    Robust Approximation of Temporal CSP.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain 2014 (0) 2014
    Conference paper
    Kazuhisa Seto, Suguru Tamaki.
    A satisfiability algorithm and average-case hardness for formulas over the full binary basis.
    Computational Complexity 2013, Volume 22 (0) 2013
    Conference paper
    Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001.
    Derandomizing the HSSW Algorithm for 3-SAT.
    Algorithmica 2013, Volume 67 (0) 2013
    Conference paper
    Gábor Kun, Ryan O'Donnell, Suguru Tamaki, Yuichi Yoshida, Yuan Zhou.
    Linear programming, width-1 CSPs, and robust satisfaction.
    Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, January 8-10, 2012 2012 (0) 2012
    Conference paper
    Suguru Tamaki, Yuichi Yoshida.
    Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Kazuhisa Seto, Suguru Tamaki.
    A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis.
    Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012 2012 (0) 2012
    Conference paper
    Kazuhisa Seto, Suguru Tamaki.
    A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis.
    Electronic Colloquium on Computational Complexity (ECCC) 2012, Volume 19 (0) 2012
    Journal article
    Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001.
    Derandomizing HSSW Algorithm for 3-SAT
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001.
    An exact algorithm for the Boolean connectivity problem for k-CNF.
    Theor. Comput. Sci. 2011, Volume 412 (0) 2011
    Conference paper
    Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001.
    Derandomizing HSSW Algorithm for 3-SAT.
    Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001.
    An Exact Algorithm for the Boolean Connectivity Problem for
    Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings 2010 (0) 2010
    Conference paper
    Suguru Tamaki, Yuichi Yoshida.
    A Query Efficient Non-adaptive Long Code Test with Perfect Completeness.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings 2010 (0) 2010
    Conference paper
    Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001.
    On the Boolean connectivity problem for Horn relations.
    Discrete Applied Mathematics 2010, Volume 158 (0) 2010
    Journal article
    Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki.
    The Planar Hajós Calculus for Bounded Degree Graphs.
    IEICE Transactions 2010, Volume 93 (0) 2010
    Conference paper
    Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki.
    Improved Randomized Algorithms for 3-SAT.
    Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I 2010 (0) 2010
    Conference paper
    Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki.
    The complexity of the Hajós calculus for planar graphs.
    Theor. Comput. Sci. 2010, Volume 411 (0) 2010
    Journal article
    Suguru Tamaki, Yuichi Yoshida.
    A Query Efficient Non-Adaptive Long Code Test with Perfect Completeness.
    Electronic Colloquium on Computational Complexity (ECCC) 2009, Volume 16 (0) 2009
    Conference paper
    Kazuo Iwama, Suguru Tamaki.
    The Complexity of the Hajos Calculus for Planar Graphs.
    Electronic Colloquium on Computational Complexity (ECCC) 2008, Volume 15 (0) 2008
    Conference paper
    Youichi Hanatani, Takashi Horiyama, Kazuo Iwama, Suguru Tamaki.
    New Graph Calculi for Planar Non-3-Colorable Graphs.
    IEICE Transactions 2008, Volume 91 (0) 2008
    Conference paper
    Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001.
    On the Boolean Connectivity Problem for Horn Relations.
    Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Kazuo Iwama, Suguru Tamaki.
    Exploiting partial knowledge of satisfying assignments.
    Discrete Applied Mathematics 2007, Volume 155 (0) 2007
    Conference paper
    Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001.
    A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem.
    Electronic Colloquium on Computational Complexity (ECCC) 2007, Volume 14 (0) 2007
    Conference paper
    Kazuo Iwama, Suguru Tamaki.
    Improved upper bounds for 3-SAT.
    Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004 2004 (0) 2004
    Conference paper
    Kazuo Iwama, Suguru Tamaki.
    Improved Upper Bounds for 3-SAT
    Electronic Colloquium on Computational Complexity (ECCC) 2003, Volume 10 (0) 2003
    Conference paper
    Kazuo Iwama, Suguru Tamaki.
    Exploiting Partial Knowledge of Satisfying Assignments.
    Algorithm Engineering, 5th International Workshop, WAE 2001 Aarhus, Denmark, August 28-31, 2001, Proceedings 2001 (0) 2001
    Show item 1 to 39 of 39  

    Your query returned 39 matches in the database.