Geek Answers Handbook

Can systems of multidimensional cubic equations be solved in polynomial time in general?

As far as I know, there are polynomial-time algorithms for systems of multidimensional quadratic equations, for example XL (eXtended Linearization). But I do not know if there is a polynomial time algorithm for a general system of multidimensional cubic equations. Can someone give me an example? Many thanks!

+4
source share
2 answers

XL works in polynomial time only if the system is overridden.

In the general case, each system of multidimensional nonlinear equations over GF (2) is equivalent to some instance of 3-SAT. Therefore, the problem of finding a solution is NP-hard.

I can suggest two other methods that are applicable in general (and in my cases were much faster than XL):

+1
source

Exact solution

- , . - "" . , - - - -, >=5: (.. ). .

, Aberth's, , , , , fast .

+1

More articles:


All Articles