Sublinear time algorithms in the theory of groups and semigroups. (Q716397)
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: Sublinear time algorithms in the theory of groups and semigroups. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7984976172447205
0 references
0.7095339298248291
0 references
0.7091749310493469
0 references
0.7023556232452393
0 references
