scientific article
From MaRDI portal
Publication:4005480
zbMath0756.20009MaRDI QIDQ4005480
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
basesShannon functionschemesfinite abelian grouprepresentativesmultiplication elementscomplexity of groups
Asymptotic results on counting functions for algebraic and topological structures (11N45) Finite abelian groups (20K01) Complexity of computation (including implicit computational complexity) (03D15) Software, source code, etc. for problems pertaining to group theory (20-04) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
On some measures of complexity of finite abelian groups, On the computation complexity of the systems of finite abelian group elements, On Bellman's and Knuth's problems and their generalizations, Comparing the computational complexity of monomials and elements of finite abelian groups, Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems