Unshuffling a square is NP-hard (Q2637646): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2163733217 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1211.7161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mappings of languages by two-tape devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shuffle languages, Petri nets, and context-sensitive grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds on the Descriptional Complexity of Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4584890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of synchronizing operations on strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending regular expressions with iterated shuffle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of shuffle automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shuffle languages are in P / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressive power of the shuffle operator matched with intersection by regular sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for a merge recognition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of a merge recognition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to software system modelling and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Recognizing Words That Are Squares for the Shuffle Product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Software Descriptions with Flow Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A P-complete language describable with iterated shuffle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit Complexity of Shuffle / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of iterated shuffle / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:06, 7 July 2024

scientific article
Language Label Description Also known as
English
Unshuffling a square is NP-hard
scientific article

    Statements

    Unshuffling a square is NP-hard (English)
    0 references
    0 references
    0 references
    13 February 2014
    0 references
    square shuffle
    0 references
    NP-completeness
    0 references

    Identifiers