Tree-like parse and polynomial subclasses of search problems

DOI10.1016/0020-0190(86)90042-6MaRDI QIDQ1082828zbMATH OpenOpenAlexFDO

Authors V. Yu. Kryauchyukas

Publication date 1986

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(86)90042-6

zbMATH Keywords

context-free grammargraph grammarstructured objectedtree-like parsing

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
• scientific article; zbMATH DE number 3474957 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(1)

• Parallel algorithms for a class of graphs generated recursively

This page was built for publication: Tree-like parse and polynomial subclasses of search problems

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