The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438)
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: The complexity of the \(K_{n,n}\)-problem for node replacement graph languages |
scientific article; zbMATH DE number 1853184
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the \(K_{n,n}\)-problem for node replacement graph languages |
scientific article; zbMATH DE number 1853184 |
Statements
The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (English)
0 references
14 January 2003
0 references
0 references
0.90613174
0 references
0 references
0.86357933
0 references
0.85937124
0 references
0.85335886
0 references
0.85213935
0 references
0.8465706
0 references
