The complexity of counting problems in equational matching (Q1914166): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1006/jsco.1995.1054 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jsco.1995.1054 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054470545 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JSCO.1995.1054 / rank | |||
Normal rank | |||
Latest revision as of 12:46, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of counting problems in equational matching |
scientific article |
Statements
The complexity of counting problems in equational matching (English)
0 references
13 August 1996
0 references
equational matching
0 references
computational complexity
0 references
