The complexity of counting problems in equational matching (Q1914166)
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 counting problems in equational matching |
scientific article; zbMATH DE number 884779
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of counting problems in equational matching |
scientific article; zbMATH DE number 884779 |
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
0.9914433360099792
0 references
0.8336935043334961
0 references
0.8288743495941162
0 references
0.8047165274620056
0 references
