On the Solvability Problem for Restricted Classes of Word Equations (Q2817397): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2955004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern matching with variables: a multivariate complexity analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterised complexity of string morphism problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-variable word equations in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recompression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for solving word equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Patterns with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank

Latest revision as of 11:31, 12 July 2024

scientific article
Language Label Description Also known as
English
On the Solvability Problem for Restricted Classes of Word Equations
scientific article

    Statements

    On the Solvability Problem for Restricted Classes of Word Equations (English)
    0 references
    0 references
    0 references
    0 references
    30 August 2016
    0 references
    word equations
    0 references
    regular constraints
    0 references
    NP-hardness
    0 references

    Identifiers