Search results
Results From The WOW.Com Content Network
In the same way, an extension K 2 of K 1 can be constructed, etc. The union of all these extensions is the algebraic closure of K , because any polynomial with coefficients in this new field has its coefficients in some K n with sufficiently large n , and then its roots are in K n +1 , and hence in the union itself.
Because (a + 1) 2 = a, a + 1 is the unique solution of the quadratic equation x 2 + a = 0. On the other hand, the polynomial x 2 + ax + 1 is irreducible over F 4, but it splits over F 16, where it has the two roots ab and ab + a, where b is a root of x 2 + x + a in F 16. This is a special case of Artin–Schreier theory.
In other words, any problem in EXPTIME is solvable by a deterministic Turing machine in O(2 p(n)) time, where p(n) is a polynomial function of n. A decision problem is EXPTIME-complete if it is in EXPTIME, and every problem in EXPTIME has a polynomial-time many-one reduction to it. A number of problems are known to be EXPTIME-complete.