## A comparison of polynomial time reducibilities.(English)Zbl 0321.68039

### MSC:

 68Q25 Analysis of algorithms and problem complexity
Full Text:

### References:

 [1] T. Baker, J. Gill and R. Solovay, Relativizations of the $$P = ? NP$$ question, SIAM J. Comput., to appear. · Zbl 0323.68033 [2] Cook, S.A., The complexity of theorem-proving procedures, Third annual ACM symposium on theory of computing, (1971) · Zbl 0363.68125 [3] Hopcroft, J.E.; Ullman, J.D., Formal languages and their relation to automata, (1969), Addison-Wesley Reading, Mass · Zbl 0196.01701 [4] Jones, N.D., Reducibility among combinatorial problems in log n space, Proc. of seventh annual Princeton conference on information sciences and systems, (1973) [5] Karp, R.M., Reducibility among combinatorial problems, () · Zbl 0366.68041 [6] Ladner, R.E., On the structure of polynomial time reducibility, J. ACM, 22, (1975) · Zbl 0322.68028 [7] Lynch, N.A., Relativization of the theory of computational complexity, () · Zbl 0353.68059 [8] A.R. Meyer, Private communication. [9] Meyer, A.R.; Stockmeyer, L.J., The equivalence problem for regular expressions with squaring requires exponential space, 13th annual IEEE symposium of switching and automata theory, (1972) [10] Meyer, A.R.; Stockmeyer, L.J., Word problems requiring exponential time, Fifth annual symposium on theory of computing, (1973) · Zbl 0359.68050 [11] Post, E.L., Recursively enumerable sets of positive integers and their decision problems, Bull. AMS, 50, (1944) · Zbl 0063.06328 [12] Rogers, M., Theory of recursive functions and effective computability, (1967), McGraw-Hill New York · Zbl 0183.01401 [13] Savage, J.E., Computational work and time on finite machines, J. ACM, 9, 4, (1972) · Zbl 0251.68031
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.