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

DOI10.1007/s00037-009-0280-6zbMath1204.68096OpenAlexW2064584528MaRDI QIDQ623500

T. C. Vijayaraghavan, V. Arvind

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

zbMATH Keywords

randomized computationabelian permutation groupslinear congruenceslog space counting classes

Mathematics Subject Classification ID

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

Related Items (1)

The complexity of intersecting finite automata having few final states

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