Are problems having a polynomial time upper bound actually thought to be feasible?
Author:
ADACHI Akeo,KASAI Takumi
Reference7 articles.
1. A. Adachi, S. Iwata, and T. Kasai, Low Level Complexity for Combinatorial Games, proc. ACM Symp. on Theory of Computing, Milwaukee, 1981.
2. Some Combinatorial Game Problems Require ω(nk) Time;Adachi;JACM,1984
3. Classes of Pebble Games and Complete Problems;Kasai;SIAM J. on comput.,1979
4. The Design and Analysis of Computer Algorithms;Aho,1974
5. On the Computational Complexity of Algorithms;Hartmanis;Trans. Amer. Math. Soc.,1965