Parsing by matrix multiplication generalized to Boolean grammars-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Parsing by matrix multiplication generalized to Boolean grammars

Published:2014-01 Issue: Volume:516 Page:101-120
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Okhotin Alexander

Funder

Academy of Finland

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference28 articles.

1. Improved time and space bounds for Boolean matrix multiplication;Adleman;Acta Inform.,1978

2. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions;Alon;Algorithmica,1996

3. On economical construction of the transitive closure of an oriented graph;Arlazarov;Sov. Math. Dokl.,1970

4. Fast stochastic context-free parsing: a stochastic version of the Valiant algorithm;Benedí,2007

5. Membership problems for regular and context-free trace languages;Bertoni;Inf. Comput.,1989

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Improved Algorithm for The k -Dyck Edit Distance Problem;ACM Transactions on Algorithms;2023-10-19

2. The hardest language for grammars with context operators;Theoretical Computer Science;2023-05

3. SPbLA: The Library of GPGPU-Powered Sparse Boolean Linear Algebra Operations;2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2021-06

4. Path Querying on Acyclic Graphs Using Boolean Grammars;Programming and Computer Software;2021-01

5. Formal languages over GF(2);Information and Computation;2020-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP