Comparing the computational complexity of monomials and elements of finite abelian groups (Q2088733): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q114039255, #quickstatements; #temporary_batch_1707149277123 |
Removed claim: author (P16): Item:Q1675531 |
||
| Property / author | |||
| Property / author: Vadim V. Kochergin / rank | |||
Revision as of 04:53, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparing the computational complexity of monomials and elements of finite abelian groups |
scientific article |
Statements
Comparing the computational complexity of monomials and elements of finite abelian groups (English)
0 references
6 October 2022
0 references
finite abelian group
0 references
computational complexity
0 references
addition chains
0 references
vectorial addition chains
0 references
Bellman's problem
0 references
Knuth's problem
0 references
