Valiant (CFG Recognition CFG Problems)
Revision as of 11:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^omega * |G|)$ where omega is the exponent for matrix multiplication == Space Complexity == $O(n^{2})$? words/cells (See matrix multiplication space complexity) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM and multitape TM == Year == 1975 == Reference == https://linkinghub.elsevier.com/retrieve/pii/S0022000075800468")
Time Complexity
$O(n^omega * |G|)$ where omega is the exponent for matrix multiplication
Space Complexity
$O(n^{2})$? words/cells
(See matrix multiplication space complexity)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM and multitape TM
Year
1975
Reference
https://linkinghub.elsevier.com/retrieve/pii/S0022000075800468