Peter Shor developed an algorithm that does activity, which would nullify RSA's usefulness; that algorithm performs in polynomial time. The Gauss-Jordan method can be used in part to perform the "LU" type of this. For 10 points, name this activity that can be done on a polynomial with a perfect square discriminant, which for the number 49 would produce 7 and 7.
Peter Shor developed an algorithm that does activity, which would nullify RSA's usefulness; that algorithm performs in polynomial time. The Gauss-Jordan method can be used in part to perform the "LU" type of this. For 10 points, name this activity that can be done on a polynomial with a perfect square discriminant, which for the number 49 would produce 7 and 7.
Peter Shor developed an algorithm that does activity, which would nullify RSA's usefulness; that algorithm performs in polynomial time.
{factorization} (accept word forms)