On the complexity of solving linear congruences and computing nullspaces modulo a constant

DOI10.4086/cjtcs.2013.010zbMath1286.68213arXiv1202.3949OpenAlexW1843605247MaRDI QIDQ5414629

Niel de Beaudrap

Publication date: 7 May 2014

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.3949

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: On the complexity of solving linear congruences and computing nullspaces modulo a constant