Publication:1405726

DOI10.1007/S10208-002-0061-YzbMATH Open1019.03027OpenAlexW2111425413MaRDI QIDQ1405726FDOQ1405726

Lou van den Dries

Publication date: 26 August 2003

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10208-002-0061-y

zbMATH Keywords

greatest common divisorintegers with transcendental ratiolimitations of primitive recursive algorithms

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Number-theoretic algorithms; complexity (11Y16) Complexity of computation (including implicit computational complexity) (03D15) Applications of model theory (03C98)

Cited In (8)

• Title not available (Why is that?)
• On primitive recursive algorithms and the greatest common divisor function
• Henselian elements
• Is the Euclidean Algorithm Optimal Among its Peers?
• Axiomatization and characterization of BSP algorithms
• RRC-fields with small absolute Galois groups
• Theoretical computer science: computability, decidability and logic
• A complete characterization of primitive recursive intensional behaviours

This page was built for publication: Generating the greatest common divisor, and limitations of primitive recursive algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1405726)