The Power of Leibniz-Like Functions as Oracles

DOI10.1007/978-3-030-50026-9_19OpenAlexW3036807934MaRDI QIDQ5042247

Ilya Volkovich, Nelson Xuzhi Zhang, Jaeyoon Kim

Publication date: 19 October 2022

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-50026-9_19

zbMATH Keywords

Möbius functioninteger factorizationsquare-free integersoraclesnumber-theoretic functions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

New Characterization of the Factor Refinement Algorithm with Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Number-theoretic functions which are equivalent to number of divisors
• Reductions among number theoretic problems
• Some remarks on computing the square parts of integers
• Factoring polynomials with rational coefficients
• Riemann's hypothesis and tests for primality
• Factor Refinement
• Sums of Divisors, Perfect Numbers and Factoring
• Factoring into coprimes in essentially linear time

This page was built for publication: The Power of Leibniz-Like Functions as Oracles