The complexity of counting problems in equational matching (Q5210797)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7154574
| 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 7154574 |
Statements
The complexity of counting problems in equational matching (English)
0 references
21 January 2020
0 references
0.9931003451347352
0 references
0.9914433360099792
0 references
0.8392959833145142
0 references
0.8360578417778015
0 references
