| [1] |
Bondy, J. A.; Murty, U. S.R., Graph Theory with Applications (1976), Macmillan: Macmillan New York · Zbl 1134.05001 |
| [2] |
Cook, S. A., The complexity of theorem-proving procedures, Proc. 3rd Annual ACM Symposium on Theory of Computing, 151-158 (1971) · Zbl 0253.68020 |
| [4] |
Hermes, H., Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit (1971), Springer: Springer Berlin · Zbl 0212.32801 |
| [5] |
Karp, R. M., Reducibility among combinatorial problems, (Complexity of Computer Computations (1973), Plenum Press: Plenum Press New York) · Zbl 0366.68041 |
| [6] |
Ladner, R. E.; Lynch, N. A.; Selman, A. L., A comparison of polynomial time reducibilities, Theoret. Comput. Sci., 1, 103-123 (1975) · Zbl 0321.68039 |
| [7] |
Post, E. L., Recursively enumerable sets of positive integers and their decision problems, Bull Amer. Math. Soc., 50, 284-316 (1944) · Zbl 0063.06328 |
| [8] |
Rogers, H., Theory of Recursive Functions and Effective Computability (1967), McGraw-Hill: McGraw-Hill New York · Zbl 0183.01401 |
