Complexity analysis of a top down algorithm motivated by power product expansions (Q5031877)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7474876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity analysis of a top down algorithm motivated by power product expansions |
scientific article; zbMATH DE number 7474876 |
Statements
Complexity analysis of a top down algorithm motivated by power product expansions (English)
0 references
16 February 2022
0 references
power products
0 references
generalized power products
0 references
generalized integer power products
0 references
power series
0 references
partitions
0 references
expansions
0 references
Diophantine equations
0 references
cryptosystems
0 references
security
0 references
top-down algorithm
0 references
0.8191403746604919
0 references
0.7781087756156921
0 references
0.6910240054130554
0 references
0.689063549041748
0 references
