scientific article; zbMATH DE number 3572260

MaRDI QIDQ4143385zbMATH OpenFDO

Authors M. A. Frumkin

Publication date 1977

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Linear Diophantine equations (11D04) Algorithms in computer science (68W99)

Cited in

(13)

• Complexity questions in number theory
• Solving systems of linear equations over polynomials
• Some remarks concerning the complexity of computing class groups of quadratic fields
• Recognizing badly presented \(Z\)-modules
• Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
• Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
• Decision problems in quadratic function fields of high genus
• Lattice basis reduction for indefinite forms and an application
• On the impossibility of purely algebraic signatures
• CoEulerian graphs
• Constructing representations of split semisimple Lie algebras
• Intruder deduction problem for locally stable theories with normal forms and inverses
• Termination of triangular polynomial loops

This page was built for publication:

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