Find an algorithm for the approximate-gcd problem for general parameters.
Statement
Find an algorithm for the approximate-gcd problem for general parameters. In particular, given a set of integers where the are small, find q in polynomial time.
As one example, what if r has bits, q has bits, and p has bits.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.