Sublinear time algorithms in the theory of groups and semigroups. (Q716397)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sublinear time algorithms in the theory of groups and semigroups. |
scientific article |
Statements
Sublinear time algorithms in the theory of groups and semigroups. (English)
0 references
28 April 2011
0 references
Sublinear time algorithms give some sort of an answer after inspecting only a small part of the input. The author considers several algorithmic problems in the theory of groups and semigroups that may admit sublinear time solution at least for ``most'' inputs.
0 references
sublinear time algorithms
0 references
complexity
0 references
primitive elements
0 references
word problem
0 references
algorithmic problems
0 references
0 references
0 references
