Expertini Research Research
  • Expertini Research profile
    • Computer Science PDF Available Non-peer-reviewed Preprint

    Common Permutation Problem

    Marian Dvorsky  ·  Published 2008-03-29
    📄 Download PDF 🔖 Bookmark Paper

    Abstract

    In this paper we show that the following problem is NP-complete: Given an alphabet $\Sigma$ and two strings over $\Sigma$, the question is whether there exists a permutation of $\Sigma$ which is a subsequence of both of the given strings.
    📄 Full Paper Available as PDF
    This paper is available as a downloadable PDF.
    📄 Download PDF

    ✨ AI Plain-English Summary

    Get a plain-English summary of this paper generated by AI (5 free per day).

    Comments (0)

    No comments yet. Be the first to comment.

    Related Papers

    Computer Science PDF

    Core-Periphery Structure in Networks

    2012