On the public citation graph

Elementary Formulas for Greatest Common Divisors and Semiprime Factors

0 signed · 17 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/1521-3870(200201)48:1<93::aid-malq93>3.0.co;2-8openalex-extracted
Plain Bases for Classes of Primitive Recursive Functions
inferredcites →https://doi.org/10.1007/bf01140159openalex-extracted
A superposition basis in the class of Kal'mar elementary functions
inferredcites →https://doi.org/10.1007/bf01693980openalex-extracted
A new proof of the theorem on exponential diophantine representation of enumerable sets
inferredcites →https://doi.org/10.1016/0020-0190(79)90087-5openalex-extracted
Factoring numbers in O(logn) arithmetic steps
inferredcites →https://doi.org/10.1016/j.exco.2024.100136openalex-extracted
An arithmetic term for the factorial function
inferredcites →https://doi.org/10.1080/00029890.1952.11988142openalex-extracted
The General Chinese Remainder Theorem
inferredcites →https://doi.org/10.1080/00029890.1991.11995793openalex-extracted
Concrete Mathematics: A Foundation for Computer Science. By Ronald Lewis Graham, Donald Ervin Knuth, and Oren Patashnik
inferredcites →https://doi.org/10.1090/s0002-9939-1969-0250878-2openalex-extracted
A New Hierarchy of Elementary Functions
inferredcites →https://doi.org/10.1090/s0002-9947-1952-0048374-2openalex-extracted
Existential Definability in Arithmetic
inferredcites →https://doi.org/10.1134/s1990478907030106openalex-extracted
Superpositions of elementary arithmetic functions
inferredcites →https://doi.org/10.1145/357980.358017openalex-extracted
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-extracted
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-extracted
The Art of Computer Programming
inferredcites →https://doi.org/10.2139/ssrn.4759607openalex-extracted
Polynomial Quotient Rings and Kronecker Substitution for Deriving Combinatorial Identities
inferredcites →https://doi.org/10.2307/1970289openalex-extracted
The Decision Problem for Exponential Diophantine Equations
inferredcites →https://doi.org/10.5860/choice.31-6100openalex-extracted
Hilbert's tenth problem
inferredcites →https://doi.org/10.2307/2324448openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science.
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.