If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283)

From MaRDI portal
Revision as of 23:59, 13 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128719284, #quickstatements; #temporary_batch_1723585310344)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6995738
Language Label Description Also known as
English
If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser
scientific article; zbMATH DE number 6995738

    Statements

    If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (English)
    0 references
    0 references
    0 references
    0 references
    19 December 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    CFG parsing
    0 references
    Dyck edit distance
    0 references
    RNA folding
    0 references
    conditional lower bounds
    0 references
    context-free grammars
    0 references
    Valiant's algorithm
    0 references
    clique algorithms
    0 references
    hardness in P
    0 references
    combinatorial algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references