Using the Coppersmith–Winograd algorithm for multiplying these matrices, this gives an asymptotic worst-case running time of . However, the constant term hidden by the Big O Notation is so large that the Coppersmith–Winograd algorithm is only worthwhile for matrices that are too large to handle on present-day computers , and this approach requires subtraction and so is only suitable for recognition. The dependence on efficient matrix multiplication cannot be avoided altogether: has proved that any parser for context-free grammars working in time can be effectively converted into an algorithm computing the product of -matrices with 0-1-entries in time , and this was extended by Abboud et al. to apply to a constant-size grammar.
using the coppersmith–winograd algorithm for multiplying these matrices this gives an asymptotic worst-case running time of  however the constant term hidden by the big o notation is so large that the coppersmith–winograd algorithm is only worthwhile for matrices that are too large to handle on present-day computers  and this approach requires subtraction and so is only suitable for recognition the dependence on efficient matrix multiplication cannot be avoided altogether has proved that any parser for context-free grammars working in time can be effectively converted into an algorithm computing the product of -matrices with 0-1-entries in time  and this was extended by abboud et al to apply to a constant-size grammar