scientific article; zbMATH DE number 7203317

DOI10.4230/LIPIcs.CPM.2017.12zbMath1434.68218arXiv1803.00804MaRDI QIDQ5110876

Karl Bringmann, Philip Wellnitz

Publication date: 25 May 2020

Full work available at URL: https://arxiv.org/abs/1803.00804

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

parsing\(k\)-cliqueconditional lower boundstree-adjoining grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser ⋮ Unnamed Item ⋮ Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles

This page was built for publication: