The complexity of solving low degree equations over ring of integers and residue rings

DOI10.3103/S0027132219010029zbMATH Open1469.68061OpenAlexW2941079682WikidataQ128023562 ScholiaQ128023562MaRDI QIDQ2319973FDOQ2319973

Authors: I. B. Gashkov, A. B. Frolov, S. B. Gashkov 

Publication date: 21 August 2019

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132219010029

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Solving polynomial systems; resultants (13P15)

Cites Work

• Title not available (Why is that?)
• Faster integer multiplication
• Factoring polynomials with rational coefficients
• Introduction to theoretical and numerical methods in cryptography
• Title not available (Why is that?)
• Explicit Bounds for Primality Testing and Related Problems
• Title not available (Why is that?)
• A Remark on the Hensel Factorization Method
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\)
• Title not available (Why is that?)
• STACS 2005

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)