Can a program (or any grammar graph) be represented in form of an extremely sparse 3-dimensional stack of 2-dimensional adjacency matrices?
Replying to @quasimondo
some parsing can be expressed in terms of matrix multiplication http://theory.stanford.edu/~virgi/cs367/papers/valiantcfg.pdf … (discussion: https://news.ycombinator.com/item?id=11977115 …)
2:46 AM - 17 Sep 2016
0 replies
0 retweets
1 like
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.