Content deleted Content added
→Valiant's algorithm: added Lee's lower bound, improved presentation |
→References: added Lee, JACM, 2002 |
||
Line 91:
* [[Donald E. Knuth]]. ''The Art of Computer Programming Volume 2: Seminumerical Algorithms''. Addison-Wesley Professional; 3 edition (November 14, 1997). ISBN 978-0201896848. pp. 501.
* Martin Lange and Hans Leiß. [http://www.informatica-didactica.de/InformaticaDidactica/LangeLeiss2009 ''To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm''.] Informatica Didactica 8, 2009. [http://www.informatica-didactica.de/InformaticaDidactica/LangeLeiss2009.pdf (pdf)]
*{{Cite journal
| last = Lee
| first = Lillian
| title = Fast context-free grammar parsing requires fast boolean matrix multiplication
| journal = [[Journal of the ACM]]
| volume = 49
| issue = 1
| pages = 1-15
| doi = 10.1145/505241.505242
}}
* [[Leslie G. Valiant]]. ''General context-free recognition in less than cubic time''. [[Journal of Computer and System Sciences]], 10:2 (1975), 308–314.
| |||