Arithmetic complexity

DOI10.1145/1459010.1459012zbMath1367.68116OpenAlexW2294814249MaRDI QIDQ5277820

Yiannis N. Moschovakis, L. P. D. van den Dries

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1459010.1459012

zbMATH Keywords

greatest common divisorcoprimenessrecursive programslower bounds for arithmetical problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

A difference in complexity between recursion and tail recursion ⋮ Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings

This page was built for publication: Arithmetic complexity