scientific article; zbMATH DE number 3572260
From MaRDI portal
zbMath0367.10012MaRDI QIDQ4143385
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Software, source code, etc. for problems pertaining to number theory (11-04) Linear Diophantine equations (11D04) Algorithms in computer science (68W99)
Related Items
Solving systems of linear equations over polynomials, Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem, Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients, Lattice basis reduction for indefinite forms and an application, On the impossibility of purely algebraic signatures, Computing the sign or the value of the determinant of an integer matrix, a complexity survey., Some remarks concerning the complexity of computing class groups of quadratic fields, Intruder deduction problem for locally stable theories with normal forms and inverses, Constructing representations of split semisimple Lie algebras, CoEulerian graphs, Decision problems in quadratic function fields of high genus, Complexity questions in number theory, Recognizing badly presented \(Z\)-modules
