Enumerations and Completely Decomposable Torsion-Free Abelian Groups
Work
Year: 2009
Type: article
Source: Theory of Computing Systems
Author Alexander Melnikov
Institution Sobolev Institute of Mathematics
Cites: 11
Cited by: 14
Related to: 10
FWCI: 0.902
Citation percentile (by year/subfield): 80.43
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed