CFG Recognition (CFG Problems)

Description

Given a grammar $G$ and a string $s$, determine if the string $s$ can be derived by the grammar $G$.

$n$: length of the given string

$|G|$: size of the grammar

Name	Year	Time	Space	Approximation Factor	Model	Reference
Cocke–Younger–Kasami algorithm	1968	G\|)$	$O(n^{2})$	Exact	Deterministic	Time & Space
Valiant	1975	G\|)$ where omega is the exponent for matrix multiplication	$O(n^{2})$?	Exact	Deterministic	Time

Error creating thumbnail: Unable to save thumbnail to destination

Problem	Implication	Year	Citation	Reduction
k-Clique	assume: k-Clique Hypothesis then: there is no $O(N^{\omega-\epsilon}) time algorithm for target for any $\epsilon > {0}$	2017	https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/abstract/document/8104058	link
k-Clique	assume: k-Clique Hypothesis then: there is no $O(N^{\{3}-\epsilon}) time combinatorial algorithm for target for any $\epsilon > {0}$	2017	https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/abstract/document/8104058	link