A note on the complexity of matching patterns with variables (Q2445237): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2013.06.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972596784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding patterns common to a set of strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a homomorphism between two words is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4749224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-learnable class of E-pattern languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discontinuities in pattern inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments from enquiries into the learnability of the pattern languages from positive data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems for patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence problem for E-pattern languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bad news on decision problems for patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion Problems for Patterns with a Bounded Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Match Test for Large Classes of Extended Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Patterns with Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized pattern matching: Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized function matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth: Characterizations, Applications, and Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of embedding planar graphs to minimize certain distance measures / rank
 
Normal rank

Latest revision as of 10:03, 8 July 2024

scientific article
Language Label Description Also known as
English
A note on the complexity of matching patterns with variables
scientific article

    Statements

    A note on the complexity of matching patterns with variables (English)
    0 references
    0 references
    14 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    formal languages
    0 references
    pattern matching with variables
    0 references
    parameterised pattern matching
    0 references
    NP-complete problems
    0 references
    membership problem for pattern languages
    0 references
    0 references