Completeness, Approximation and Density

SIAM Journal on Computing - Tập 10 Số 4 - Trang 787-796 - 1981
Ker‐I Ko, Daniel J. Moore

Tóm tắt

Từ khóa


Tài liệu tham khảo

Aho Alfred V., 1975, The design and analysis of computer algorithms

10.1137/0204037

10.1007/3-540-08860-1_6

10.2307/2271984

Garey M. R., 1976, Algorithms and complexity (Proc. Sympos., Carnegie-Mellon Univ., Pittsburgh, Pa., 1976), 41

Garey Michael R., 1979, Computers and intractability

10.2307/2272852

10.1137/0206023

Karp Richard M., 1976, Algorithms and complexity (Proc. Sympos., Carnegie-Mellon Univ., Pittsburgh, Pa., 1976), 1

10.1016/S0022-0000(74)80003-6

10.1145/321892.321895

Rogers, Jr. Hartley, 1967, Theory of recursive functions and effective computability

10.1145/321958.321975