| other,29-2-P97-1002,ak | ) on a <term> grammar </term> G and a <term> | string | </term> w can be used to multiply m x m <term> | #28993 We prove a dual result: CFG parsers running in time O(\[Gl\[w\[ 3-e) on a grammar G and a string w can be used to multiply m x m Boolean matrices in time O(m3-e/3). |
