Tree-like parse and polynomial subclasses of search problems☆
References (3)
Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
Inform. Process. Letters
(1982)
There are more references available in the full text version of this article.
Cited by (1)
Parallel algorithms for a class of graphs generated recursively
1989, Information Processing Letters
- ☆
This article is registered with the Copyright Agency of the U.S.S.R.
Copyright © 1986 Published by Elsevier B.V.