Algorithmic theory of free solvable groups: randomized computations. (Q402669)
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: Algorithmic theory of free solvable groups: randomized computations. |
scientific article; zbMATH DE number 6335284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic theory of free solvable groups: randomized computations. |
scientific article; zbMATH DE number 6335284 |
Statements
Algorithmic theory of free solvable groups: randomized computations. (English)
0 references
28 August 2014
0 references
free solvable groups
0 references
metabelian groups
0 references
word problem
0 references
cyclic subgroup membership problem
0 references
power problem
0 references
conjugacy problem
0 references
randomized algorithms
0 references
Monte Carlo type algorithms
0 references
0.8416863679885864
0 references
0.8065471053123474
0 references
0.7876020073890686
0 references
0.7873397469520569
0 references
0.782289445400238
0 references
