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

An Analysis of Memory Space Usage by Algorithms Solving NL Search Problems

Research Project

Project/Area Number 16K00013
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeMulti-year Fund
Section一般
Research Field Theory of informatics
Research InstitutionUniversity of Fukui

Principal Investigator

YAMAKAMI TOMOYUKI  福井大学, 学術研究院工学系部門, 教授 (80230324)

Project Period (FY) 2016-04-01 – 2019-03-31
Project Status Completed (Fiscal Year 2018)
Budget Amount *help
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2018: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2017: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2016: ¥2,080,000 (Direct Cost: ¥1,600,000、Indirect Cost: ¥480,000)
Keywords計算量理論 / 使用メモリ領域量 / アルゴリズムの効率 / 線形領域仮説 / オンラインアルゴリズム / 弱線形メモリ領域還元 / 線形メモリ領域仮説 / 弱線形メモリ領域計算 / オートマトン / 内部状態数 / 計算モデル / トポロジカルオートマトン / アルゴリズム / 非決定性対数領域計算 / NL 最適化問題 / NL 探索問題 / 決定性アルゴリズムの効率 / 巨大ベータ処理 / メモリ領域 / 半線形領域計算量 / パラメタ化 / 有向グラフ経路探索問題 / 論理式充足判定問題 / 線形計画法 / メモリ領域量 / 探索アルゴリズム / NL探索問題 / メモリ領域仮説
Outline of Final Research Achievements

A recent establishment of telecommunication infrastructure has made it possible to collect all sorts of data through worldwide computer networks and to store them in large-scale databases. Users are more prone to use hand-held devices, such as smartphones and tablets, to process instantly needed data that are streamlined by high-speed network connections. Unfortunately, in such small devices, memory space is physically limited due to their sheer size. This research sought for identifying the minimum memory usage of online software designed to solve many real-life problems. In particular, this work devised a practical working hypothesis, called the linear space hypothesis, and obtained much tighter bounds on the minimum usage of memory space under this new hypothesis. This work shall help industry design more sophisticated software running on small devices to solve real-life problems.

Academic Significance and Societal Importance of the Research Achievements

本研究成果は、小型デバイス上でビッグデータを取り扱うソフトウェア開発・設計に大きく貢献すると共に、今後社会インフラ設備の基盤となる情報産業の根幹を支える技術開発の支柱に成ると考えられる。特に本研究によって、多くの実用的な問題を処理するデバイスの小型化の技術的な限界が明確になり、メモリ効率の優れたソフトウェアによる巨大データ処理技術の進歩を著しく促すと期待できる。学術的にも、本研究が提案する作業用仮説は、デバイス内でのメモリ領域の効率的な使用方法の開発に向けた試金石となり、今後の探索問題研究の進歩と発展に多大な貢献が見込まれる。

Report

(4 results)
  • 2018 Annual Research Report   Final Research Report ( PDF )
  • 2017 Research-status Report
  • 2016 Research-status Report
  • Research Products

    (14 results)

All 2019 2018 2017 2016 Other

All Int'l Joint Research (1 results) Journal Article (10 results) (of which Peer Reviewed: 10 results,  Open Access: 2 results) Presentation (2 results) Remarks (1 results)

  • [Int'l Joint Research] トロント大学(カナダ)

    • Related Report
      2016 Research-status Report
  • [Journal Article] Behavioral strengths and weaknesses of various models of limited automata2019

    • Author(s)
      Tomoyuki Yamakami
    • Journal Title

      Proceedings of the 45th International Conference on Current Trends in Theory and Practice of Computer Science, Lecture Notes in Computer Science, Springer-Verlag

      Volume: 11376 Pages: 519-530

    • DOI

      10.1007/978-3-030-10801-4_40

    • ISBN
      9783030108007, 9783030108014
    • Related Report
      2018 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice2019

    • Author(s)
      Tomoyuki Yamakami
    • Journal Title

      Proceedings of the 13th International Conference on Language and Automata Theory and Applications, Lecture Notes in Computer Science, Springer-Verlag

      Volume: 11417 Pages: 134-145

    • DOI

      10.1007/978-3-030-13435-8_10

    • ISBN
      9783030134341, 9783030134358
    • Related Report
      2018 Annual Research Report
    • Peer Reviewed
  • [Journal Article] State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis2018

    • Author(s)
      Tomoyuki Yamakami
    • Journal Title

      Proceedings of the 20th IFIP WG 1.02 International Conference on Descriptional Complexity of Formal Systems, Lecture Notes in Computer Science, Springer-Verlag

      Volume: 10952 Pages: 237-249

    • DOI

      10.1007/978-3-319-94631-3_20

    • ISBN
      9783319946306, 9783319946313
    • Related Report
      2018 Annual Research Report
    • Peer Reviewed
  • [Journal Article] One-way topological automata and the tantalizing effects of their topological features2018

    • Author(s)
      Tomoyuki Yamakami
    • Journal Title

      Proceedings of the 10th Workshop on Non-Classical Models of Automata and Applications, Osterreichische Computer Gesellschaft, the Austrian Computer Society

      Volume: 2018 Pages: 197-214

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Parameterized graph connectivity and polynomial-time sub-linear-space short reductions (preliminary report)2017

    • Author(s)
      Tomoyuki Yamakami
    • Journal Title

      Proceedings of the 11th International Workshop on Reachability Problems (RP 2017), Lecture Notes in Computer Science, Springer-Verlag

      Volume: 10506 Pages: 176-191

    • DOI

      10.1007/978-3-319-67089-8_13

    • ISBN
      9783319670881, 9783319670898
    • Related Report
      2017 Research-status Report
    • Peer Reviewed
  • [Journal Article] The 2CNF Boolean formula satisfiability problem and the linear space hypothesis2017

    • Author(s)
      Tomoyuki Yamakami
    • Journal Title

      Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Leibniz International Proceedings in Informatics (LIPIcs)

      Volume: 83

    • DOI

      10.4230/LIPIcs.MFCS.2017.6

    • Related Report
      2017 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] A recursive definition of quantum polynomial time computability (extended abstract)2017

    • Author(s)
      Tomoyuki Yamakami
    • Journal Title

      Proceedings of the 9th Workshop on Non-Classical Models of Automata and Applications (NCMA 2017), Osterreichische Computer Gesellschaft 2017, the Austrian Computer Society

      Volume: 2017 Pages: 243-258

    • Related Report
      2017 Research-status Report
    • Peer Reviewed
  • [Journal Article] One-way bounded-error probabilistic pushdown automata and Kolmogorov complexity (preliminary report)2017

    • Author(s)
      Tomoyuki Yamakami
    • Journal Title

      Proceedings of the 21st International Conference on Developments in Language Theory (DLT 2017), Lecture Notes in Computer Science, Springer-Verlag

      Volume: 10396 Pages: 353-364

    • DOI

      10.1007/978-3-319-62809-7_28

    • ISBN
      9783319628080, 9783319628097
    • Related Report
      2017 Research-status Report
    • Peer Reviewed
  • [Journal Article] Pseudorandom generators against advised context-free languages2016

    • Author(s)
      Tomoyuki Yamakami
    • Journal Title

      Theoretical Computer Science

      Volume: 613 Pages: 1-27

    • DOI

      10.1016/j.tcs.2015.10.026

    • Related Report
      2016 Research-status Report
    • Peer Reviewed
  • [Journal Article] Quantum list decoding of classical block codes of polynomially small rate from quantumly corrupted codewords2016

    • Author(s)
      Tomoyuki Yamakami
    • Journal Title

      Baltic Journal of Modern Computing

      Volume: 4(4) Pages: 753-788

    • Related Report
      2016 Research-status Report
    • Peer Reviewed / Open Access
  • [Presentation] Non-uniform state complexity of quantum finite automata and quantum polynomial-time logarithmic-space computation with quantum advice -- (preliminary report) --2018

    • Author(s)
      Tomoyuki Yamakami
    • Organizer
      電子情報通信学会 量子情報技術研究会(QIT)
    • Related Report
      2018 Annual Research Report
  • [Presentation] State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis2018

    • Author(s)
      Tomoyuki Yamakami
    • Organizer
      情報処理学会 アルゴリズム研究会(SIGAL)
    • Related Report
      2018 Annual Research Report
  • [Remarks] Tomoyuki Yamakami Homepage

    • URL

      http://TomoyukiYamakami.org/

    • Related Report
      2016 Research-status Report

URL: 

Published: 2016-04-21   Modified: 2020-03-30  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi