[[1] Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1979. ISBN 0716710447.]Search in Google Scholar
[[2] Richard M. Karp. Reducibility among combinatorial problems. In Miller et al. [3], pages 85–103. ISBN 978-1-4684-2001-2. doi:10.1007/978-1-4684-2001-2_9.10.1007/978-1-4684-2001-2_9]Search in Google Scholar
[[3] Raymond E. Miller, James W. Thatcher, and Jean D. Bohlinger, editors. Complexity of Computer Computations, 1972. Springer US. ISBN 978-1-4684-2001-2. doi:10.1007/978-1-4684-2001-2_9.10.1007/978-1-4684-2001-2_9]Search in Google Scholar
[[4] Wojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569–573, 1990.]Search in Google Scholar
