scientific article; zbMATH DE number 6004943
From MaRDI portal
Publication:3115682
zbMATH Open1249.94069MaRDI QIDQ3115682FDOQ3115682
Publication date: 10 February 2012
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 3930982
- scientific article; zbMATH DE number 3970736
- scientific article
- Maximal computational complexity of systems of elements of free Abelian group
- On the computational complexity of the theory of Abelian groups
- On the complexity of computation in finite Abelian, nilpotent and soluble groups
- scientific article; zbMATH DE number 609987
- On some measures of complexity of finite abelian groups
- On some computational problems in finite abelian groups
- On the complexity of intersection and conjugacy problems in free groups
Cited In (4)
- Complexity of certain systems of monomials in calculation by composition circuits
- Maximal computational complexity of systems of elements of free Abelian group
- On Bellman's and Knuth's problems and their generalizations
- Relation between two measures of the computation complexity for systems of monomials
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115682)
