Valiant (CFG Recognition CFG Problems)

From Algorithm Wiki
Revision as of 10: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.ezproxy.canberra.edu.au/retrieve/pii/S0022000075800468")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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.ezproxy.canberra.edu.au/retrieve/pii/S0022000075800468

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Valiant_(CFG_Recognition_CFG_Problems)&oldid=44883"