Some combinatorial game problems require Ω( n k ) time-Reference-Cited by-同舟云学术

Some combinatorial game problems require Ω( n k ) time

Published:1984-03-30 Issue:2 Volume:31 Page:361-376
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Adachi Akeo¹,Iwata Shigeki²,Kasai Takumi³

Affiliation:

1. Science Institute, IBM Japan, Ltd., 5-19 San-Ban cho, Chiyodaku, 102 Tokyo, Japan

2. Information Science Laboratory, Tokai University, Kita-Kaname 1117, Hiratsuka-shi, Kanagawa 259-12, Japan

3. Department of Computer Science, University of Electro-Communications, Chofu-shi, Tokyo 182, Japan

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference4 articles.

1. the computational complexity of algorithms;HARTMANIS J.;Trans. Am Math Soc,1965

2. Classes of pebble g,q.mes and complete problems;KASAI T.;SIAM.L Comput.,1979

3. HOPCROVr J.E AND ULLMAN -J;I~I Introduction to Automata Theory Languages and Computation. Addlson-Wesley~ Reading Mass. 1979 HOPCROVr J.E AND ULLMAN -J;I~I Introduction to Automata Theory Languages and Computation. Addlson-Wesley~ Reading Mass. 1979

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. From the W-hierarchy to XNLP;WALCOM: Algorithms and Computation;2022

2. Verifying whether one-tape Turing machines run in linear time;Journal of Computer and System Sciences;2020-02

3. Just a Pebble Game;2013 IEEE Conference on Computational Complexity;2013-06

4. Grenzen des Formalisierens;Algorithmik für Einsteiger;2013

5. On the Complexity of Finding Narrow Proofs;2012 IEEE 53rd Annual Symposium on Foundations of Computer Science;2012-10