On the complexity of computation in finite Abelian, nilpotent and soluble groups (Q4303909)

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 634054
Language Label Description Also known as
default for all languages
No label defined
    English
    On the complexity of computation in finite Abelian, nilpotent and soluble groups
    scientific article; zbMATH DE number 634054

      Statements

      On the complexity of computation in finite Abelian, nilpotent and soluble groups (English)
      0 references
      7 September 1994
      0 references
      word length
      0 references
      schemes of functional elements
      0 references
      computation of finite group elements
      0 references
      set of generators
      0 references
      computation complexity
      0 references
      finite soluble groups
      0 references
      Shannon functions
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references