Is there an polynomial time algorithm to find that sum of square-roots is less than an integer? – cs.stackexchange.com

Is there an polynomial time algorithm to find that sum of square-roots is less than an integer? – cs.stackexchange.com

07:01 No Comments
Given : A list of $n$ integers $x_1,x_2,\dots,x_n$ and an integer $k$. Find : Is $\sqrt x_1 + \sqrt x_2, \cdots \sqrt x_n \le k$? Algorithm: Compute the square-root of each value -- $O(l)$ for ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Unknown

0 Comment to "Is there an polynomial time algorithm to find that sum of square-roots is less than an integer? – cs.stackexchange.com"

Post a Comment

Subscribe to: Post Comments (Atom)