THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS (Q3421602)
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 CHECKING IDENTITIES OVER FINITE GROUPS |
scientific article; zbMATH DE number 5123196
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS |
scientific article; zbMATH DE number 5123196 |
Statements
THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS (English)
0 references
7 February 2007
0 references
computational complexity
0 references
finite groups
0 references
identity checking
0 references
term equivalence
0 references
equation solvability
0 references
finite metabelian groups
0 references
0 references
0.834079384803772
0 references
0.8256655335426331
0 references
0.8091372847557068
0 references
0.8042853474617004
0 references
0.7915454506874084
0 references
