On the Complexity of the Sub-permutation Problem - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Shlomo Ahal, Yuri Rabinovich. On the Complexity of the Sub-permutation Problem. In Magnús M. Halldórsson, editor, Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings. Volume 1851 of Lecture Notes in Computer Science, pages 490-503, Springer, 2000. [doi]

This author has not been identified. Look up 'Shlomo Ahal' in GoogleThis author has not been identified. Look up 'Yuri Rabinovich' in Google

runs on WebDSL