Absoluteness of subword inequality is undecidable (Q764348): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subword histories and Parikh matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4294173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3887444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON INEQUALITIES BETWEEN SUBWORD HISTORIES / rank
 
Normal rank

Latest revision as of 00:28, 5 July 2024

scientific article
Language Label Description Also known as
English
Absoluteness of subword inequality is undecidable
scientific article

    Statements

    Absoluteness of subword inequality is undecidable (English)
    0 references
    0 references
    13 March 2012
    0 references
    subword history
    0 references
    subword inequality
    0 references
    Hilbert's 10th problem
    0 references
    Diophantine equation
    0 references
    undecidability
    0 references
    NP-hardness
    0 references
    absoluteness problem
    0 references
    equality problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references