scientific article; zbMATH DE number 3637281

MaRDI QIDQ4197337zbMATH OpenFDO

Authors Walter L. Ruzzo

Publication date 1979

zbMATH Keywords

Boolean MatricesContext-Free LanguagesMultiplyingParsingTime Complexity of Recognition

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cited in

(7)

• Optimal parallel parsing of bracket languages
• On the complexity of parallel parsing of general context-free languages
• Structured prediction with reinforcement learning
• If the current clique algorithms are optimal, so is Valiant's parser
• Computing LOGCFL certificates
• Small-space algorithms for the online language distance problem for palindromes and squares
• Quantum speedups for polynomial-time dynamic programming algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4197337)