Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings

DOI10.1016/j.jsc.2008.11.001zbMath1222.11148MaRDI QIDQ1015166

J. Martínez

Publication date: 7 May 2009

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2008.11.001

zbMATH Keywords

computational complexity; imaginary quadratic fields; norm Euclidean algorithm

Mathematics Subject Classification ID

11R11: Quadratic extensions

11Y16: Number-theoretic algorithms; complexity

11Y40: Algebraic number theory computations

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)