• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

On Algorithmic Approaches to Proving Circuit Lower Bounds

Research Project

Project/Area Number 26730007
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeMulti-year Fund
Research Field Theory of informatics
Research InstitutionSeikei University

Principal Investigator

Seto Kazuhisa  成蹊大学, 理工学部, 講師 (20584056)

Project Period (FY) 2014-04-01 – 2017-03-31
Project Status Completed (Fiscal Year 2016)
Budget Amount *help
¥3,380,000 (Direct Cost: ¥2,600,000、Indirect Cost: ¥780,000)
Fiscal Year 2016: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2015: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2014: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Keywords計算量理論 / 充足可能性問題 / 回路計算量 / 閾値回路 / 分岐プログラム / 厳密アルゴリズム / 論理回路 / 最大充足可能性問題
Outline of Final Research Achievements

P versus NP problem is the most important problem in theoretical computer science. Our ultimate goal is to solve this problem. Toward this goal, we study on the connection between fast satisfiability algorithms and circuit complexity. In this research, we gave the first algorithm that solves the satisfiability problem of constant depth circuits with a few symmetric gates. It runs faster than brute force search. In addition, we gave a new algorithm for the maximum satisfiability problems.

Report

(4 results)
  • 2016 Annual Research Report   Final Research Report ( PDF )
  • 2015 Research-status Report
  • 2014 Research-status Report
  • Research Products

    (8 results)

All 2016 2015 2014

All Journal Article (4 results) (of which Peer Reviewed: 4 results,  Acknowledgement Compliant: 3 results,  Open Access: 2 results) Presentation (4 results) (of which Int'l Joint Research: 3 results)

  • [Journal Article] An Exact Algorithm for Oblivious Read-Twice Branching Program Satisfiability2016

    • Author(s)
      Kazuhisa Seto and Junichi Teruyama
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E99.A Issue: 6 Pages: 1019-1024

    • DOI

      10.1587/transfun.E99.A.1019

    • NAID

      130005154212

    • ISSN
      0916-8508, 1745-1337
    • Related Report
      2016 Annual Research Report
    • Peer Reviewed / Acknowledgement Compliant
  • [Journal Article] An Introduction to Lower Bounds on Resolution Proof Systems2015

    • Author(s)
      Kazuhisa Seto
    • Journal Title

      Interdisciplinary Information Sciences

      Volume: 21 Issue: 4 Pages: 307-328

    • DOI

      10.4036/iis.2015.L.02

    • NAID

      110009992968

    • ISSN
      1340-9050, 1347-6157
    • Related Report
      2015 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction2015

    • Author(s)
      Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki
    • Journal Title

      Theory Comput. Syst.

      Volume: 57(2) Issue: 2 Pages: 426-443

    • DOI

      10.1007/s00224-014-9600-6

    • Related Report
      2015 Research-status Report
    • Peer Reviewed / Open Access / Acknowledgement Compliant
  • [Journal Article] Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction2014

    • Author(s)
      Takayuki Sakai, Kazuhisa Seto, and Suguru Tamaki
    • Journal Title

      Theory and Applications of Satisfiability Testing (SAT 2014)

      Volume: 8561 Pages: 32-47

    • DOI

      10.1007/978-3-319-09284-3_4

    • NAID

      120005576220

    • ISBN
      9783319092836, 9783319092843
    • Related Report
      2014 Research-status Report
    • Peer Reviewed / Acknowledgement Compliant
  • [Presentation] Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression2016

    • Author(s)
      Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki and Junichi Teruyama
    • Organizer
      The 41st International Symposium on Mathematical Foundations of Computer Science
    • Place of Presentation
      Krakow, Poland
    • Year and Date
      2016-08-22
    • Related Report
      2016 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Improved Exact Algorithms for Mildly Sparse Instances of Max SAT2015

    • Author(s)
      Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki and Junichi Teruyama
    • Organizer
      The 10th International Symposium on Parameterized and Exact Computation
    • Place of Presentation
      Patras, Greece
    • Year and Date
      2015-09-16
    • Related Report
      2015 Research-status Report
    • Int'l Joint Research
  • [Presentation] A Moderately Exponential Time Algorithm for k-IBDD Satisfiability2015

    • Author(s)
      Atsuki Nagao, Kazuhisa Seto and Junichi Teruyama
    • Organizer
      The 14th Workshop on Algorithms and Data Structures
    • Place of Presentation
      Victoria, Canada
    • Year and Date
      2015-08-05
    • Related Report
      2015 Research-status Report
    • Int'l Joint Research
  • [Presentation] Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction2014

    • Author(s)
      Takayuki Sakai, Kazuhisa Seto, and Suguru Tamaki
    • Organizer
      The 17th International Conference on Theory and Applications of Satisfiability Testing
    • Place of Presentation
      Vienna, Austria
    • Year and Date
      2014-07-14 – 2014-07-17
    • Related Report
      2014 Research-status Report

URL: 

Published: 2014-04-04   Modified: 2018-03-22  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi