Content deleted Content added
No edit summary |
No edit summary |
||
Line 13:
}}</ref>
The importance of the CYK algorithm stems from the fact that it constructively proves that the [[membership problem]](question concerning whether a [[
Using [[Landau symbol]]s, the [[Analysis of algorithms|worst case running time]] of CYK is <math>\Theta(n^3 \cdot |G|)</math>, where ''n'' is the length of the parsed string and ''|G|'' is the size of the CNF grammar ''G''.
|