Context-free grammars as a tool for describing polynomial-time subclasses of hard problems (Q1164998)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Context-free grammars as a tool for describing polynomial-time subclasses of hard problems |
scientific article; zbMATH DE number 3765134
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Context-free grammars as a tool for describing polynomial-time subclasses of hard problems |
scientific article; zbMATH DE number 3765134 |
Statements
Context-free grammars as a tool for describing polynomial-time subclasses of hard problems (English)
0 references
1982
0 references
Hamiltonian circuit problem
0 references
context-free graph grammar
0 references
polynomial-time algorithm
0 references
