Classifying problems on linear congruences and Abelian permutation groups using logspace counting classes

DOI10.1007/S00037-009-0280-6zbMATH Open1204.68096OpenAlexW2064584528MaRDI QIDQ623500FDOQ623500

Authors: Vikraman Arvind, T. C. Vijayaraghavan 

Publication date: 7 February 2011

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-009-0280-6

Recommendations

• scientific article; zbMATH DE number 1254012
• scientific article; zbMATH DE number 849283
• On the complexity of the classification problem for torsion-free Abelian groups of finite rank
• On some computational problems in finite abelian groups
• Measuring the classification difficulty of countable torsion-free Abelian groups.
• On a permutation problem for finite abelian groups
• Algorithmic approach to logarithmic class groups
• On the complexity of the classification problem for torsion-free abelian groups of rank two.
• ON CONJUGACY CLASSES IN LINEAR GROUPS
• scientific article; zbMATH DE number 561973

zbMATH Keywords

abelian permutation groupslinear congruenceslog space counting classesrandomized computation

Mathematics Subject Classification ID

Linear equations (linear algebraic aspects) (15A06) General theory for finite permutation groups (20B05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Vector spaces, linear dependence, rank, lineability (15A03)

Cited In (2)

• The complexity of intersecting finite automata having few final states
• On the complexity of solving linear congruences and computing nullspaces modulo a constant

This page was built for publication: Classifying problems on linear congruences and Abelian permutation groups using logspace counting classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623500)