One context unification problems solvable in polynomial time (Q4635831)
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 6863414
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One context unification problems solvable in polynomial time |
scientific article; zbMATH DE number 6863414 |
Statements
One Context Unification Problems Solvable in Polynomial Time (English)
0 references
23 April 2018
0 references
0.8891226649284363
0 references
0.8079753518104553
0 references
0.7747951149940491
0 references
0.7718179225921631
0 references
0.7691316604614258
0 references
