If the current clique algorithms are optimal, so is Valiant's parser (Q4562283)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6995738
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
19 December 2018
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.8235456943511963
0 references
0.7598106861114502
0 references
0.75178462266922
0 references
0.7434571981430054
0 references
0.7378930449485779
0 references
