"Fast context-free grammar parsing requires fast boolean matrix multiplication."

Lillian Lee (2002)

> Home

Details and statistics

DOI: 10.1145/505241.505242

access: closed

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/Lee02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/Lee02
Lillian Lee:
Fast context-free grammar parsing requires fast boolean matrix multiplication. J. ACM 49(1): 1-15 (2002)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.