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 10 of 40  
    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
    Journal article
    Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama.
    Improved exact algorithms for mildly sparse instances of Max SAT.
    Theor. Comput. Sci. 2017, Volume 697 (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
    Show item 1 to 10 of 40  

    Your query returned 40 matches in the database.