On polynomial time computable problems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 108)
In this paper, we investigate problems which require O(nk) time, for each interger k, where n is the size of input. Also, we present a number of problems which require exponential time.
KeywordsPolynomial Time Turing Machine Exponential Time Size Function Polynomial Space
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
- A. V. Aho, J. E. Hopcroft and J. D. Ullman. The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.Google Scholar
- A. K. Chandra and L. J. Stockmeyer, Alternation, Proc. 17th Ann. IEEE Symp. on Foundation of Computer Sciences, 1976, pp.98–108.Google Scholar
- S. A. Cook, The complexity of theorem-proving procedures, Proc. 3rd ACM Symp. on Theory of Computing, 1971, pp.151–158.Google Scholar
- S. Even and R. R. Tarjan, A combinatorial problem which is complete in polynomial space, J. Assc. Comput. Mach., 23(1976), pp.710–719.Google Scholar
- W. D. Jones and W. T. Laaser, Complete problems for deterministic polynomial time, Theoretical Comput. Sci., 3(1977), pp.105–117.Google Scholar
- R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds., Plenum Press, New York, 1972, pp.85–104.Google Scholar
- T. Kasai, A. Adachi and S. Iwata, Classes of pebble games and complete problems, SIAM J. Comput. 8(1979) pp.574–586.Google Scholar
- T. Kasai and A. Adachi, A characterization of time complexity by simple loop programs, J. Comput. System Sci., 20(1980) pp.1–17.Google Scholar
- T. J. Schaefer, Complexity of decision problems based on finite two-person perfect-information games, Proc. 8th Ann. ACM Symp. on Theory of Computing, 1976, pp.41–49.Google Scholar
© Springer-Verlag Berlin Heidelberg 1981