M. K. Richard, “Reducibility among combinatorial prob-lems,” in R. E. Miller and J. W. Thatcher (editors): Com-plexity of Computer Computations, pp. 85–103, Plenum, New York, 1972.
has been cited by the following article:
Related Articles: