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

DOI10.3103/S0027132219010029zbMath1469.68061OpenAlexW2941079682WikidataQ128023562 ScholiaQ128023562MaRDI QIDQ2319973

I. B. Gashkov, A. B. Frolov, Sergey 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

Mathematics Subject Classification ID

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

Cites Work

• Factoring polynomials with rational coefficients
• Explicit Bounds for Primality Testing and Related Problems
• Faster Integer Multiplication
• A Remark on the Hensel Factorization Method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of solving low degree equations over ring of integers and residue rings