Classifying problems on linear congruences and Abelian permutation groups using logspace counting classes
type: Item
instance of: scholarly article
title: Classifying problems on linear congruences and Abelian permutation groups using logspace counting classes
zbMATH Open document ID: 1204.68096
author: Vikraman Arvind
author: T. C. Vijayaraghavan
published in: Computational Complexity
publication date: 2011-02-07T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 15A03
Mathematics Subject Classification ID: 15A06
Mathematics Subject Classification ID: 20B05
zbMATH DE Number: 5847519
zbMATH Keywords: log space counting classes
zbMATH Keywords: abelian permutation groups
zbMATH Keywords: linear congruences
zbMATH Keywords: randomized computation
MaRDI profile type: Publication
full work available at URL: s00037-009-0280-6
OpenAlex ID: W2064584528
DOI: 10.1007/S00037-009-0280-6
Recommended article: Q4226994
Recommended article: Q4865864
Recommended article: On the complexity of the classification problem for torsion-free Abelian groups of finite rank
Recommended article: On some computational problems in finite abelian groups
Recommended article: Measuring the classification difficulty of countable torsion-free Abelian groups.
Recommended article: On a permutation problem for finite abelian groups
Recommended article: Algorithmic approach to logarithmic class groups
Recommended article: On the complexity of the classification problem for torsion-free abelian groups of rank two.
Recommended article: ON CONJUGACY CLASSES IN LINEAR GROUPS
Recommended article: Q4290396
description: scientific article; zbMATH DE number 5847519