Given a polynomial equation of degree n with m variables, that is guaranteed to have at least one solution, what is would be the Big O notation of the least complex algorithm to find a solution?


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.