Context-free grammars as a tool for describing polynomial-time subclasses of hard problems (Q1164998): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:25, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Context-free grammars as a tool for describing polynomial-time subclasses of hard problems |
scientific article |
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
