Richard M. Karp. Reducibility among combinatorial problems. Complexity of computer computations, Proceedings of a Symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Center, Yorktown Heights, New York, edited by Raymond E. Miller and James W. Thatcher, Plenum Press, New York and London
1972, pp. 85–103.
-
Published:1975-12
Issue:4
Volume:40
Page:618-619
-
ISSN:0022-4812
-
Container-title:Journal of Symbolic Logic
-
language:en
-
Short-container-title:J. symb. log.
Publisher
Cambridge University Press (CUP)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献