Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
134
click to vote
JACM
2002
83
views
more
JACM 2002
»
Fast context-free grammar parsing requires fast boolean matrix multiplication
15 years 4 months ago
Download
www.cs.cornell.edu
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG par...
Lillian Lee
claim paper
Read More »