Context-free grammars as a tool for describing polynomial-time subclasses of hard problems (Q1164998): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(82)90086-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2041034381 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Context-free graph grammars / rank | |||
Normal rank | |||
Latest revision as of 14:56, 13 June 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
