You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Lee shows that it is possible to reduce boolean matrices multiplication to context-free parsing.
Is it possible to use GLL for matrices multiplication?
Any nontrivial properties of matrices multiplication algorithm, based on GLL. For example, GLL worst-case complexity is cubic, but it is linear for LL grammars. How this property maps to properties of matrices multiplication algorithm?
The text was updated successfully, but these errors were encountered:
Lee shows that it is possible to reduce boolean matrices multiplication to context-free parsing.
The text was updated successfully, but these errors were encountered: