consider the following algorithm for completing the square rootof an n-bit integer
square root(x): for i=1,2....,[x/2] do
if isquare == x then
output i
end if
end for
claim : the above algorithm runs in polynomial time.
consider the following algorithm for completing the square root of an n-bit integer square root(x): for i=1,2....,[x/2]
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
consider the following algorithm for completing the square root of an n-bit integer square root(x): for i=1,2....,[x/2]
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!