scientific article; zbMATH DE number 3637281

zbMATH Open0409.68024MaRDI QIDQ4197337FDOQ4197337

Authors: Walter L. Ruzzo 

Publication date: 1979

Title of this publication is not available (Why is that?)

zbMATH Keywords

ParsingBoolean MatricesContext-Free LanguagesMultiplyingTime Complexity of Recognition

Mathematics Subject Classification ID

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

Cited In (5)

• Computing LOGCFL certificates
• If the current clique algorithms are optimal, so is Valiant's parser
• On the complexity of parallel parsing of general context-free languages
• Structured prediction with reinforcement learning
• Optimal parallel parsing of bracket languages

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)