The complexity of solving low degree equations over ring of integers and residue rings
From MaRDI portal
Publication:2319973
Recommendations
- STACS 2005
- Solution algorithms for systems of linear equations over residue rings
- Algorithms for solving systems of linear Diophantine equations in residue rings
- scientific article; zbMATH DE number 4216963
- scientific article; zbMATH DE number 16652
- scientific article; zbMATH DE number 3889515
- Complexity of solution of linear systems in rings of differential operators
- Solutions of systems of algebraic equations and linear maps on residue class rings
- The complexity of the equivalence problem over finite rings.
- scientific article; zbMATH DE number 177033
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1249172 (Why is no real title available?)
- scientific article; zbMATH DE number 1144309 (Why is no real title available?)
- scientific article; zbMATH DE number 2123741 (Why is no real title available?)
- A Remark on the Hensel Factorization Method
- Explicit Bounds for Primality Testing and Related Problems
- Factoring polynomials with rational coefficients
- Faster integer multiplication
- Introduction to theoretical and numerical methods in cryptography
Cited in
(4)
This page was built for publication: The complexity of solving low degree equations over ring of integers and residue rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2319973)