| other,39-2-P97-1002,ak | </term> w can be used to multiply m x m <term> | Boolean matrices | </term> in <term> time </term> O ( m3-e/3 ) | #29003 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). |
