Agrawal, Kayal and Saxena showed that determining the (*) primality of a number is in this class, and another problem in this class is the decision version of finding the greatest common divisor.
Vardi and Immerman showed that this class can be defined as the problems which can be expressed in first-order logic plus a least fixed point operator, in the presence of linear order. This class is equivalent to AL, the class of problems which can be solved in a logarithmic amount of memory space on an alternating Turing machine. Agrawal, Kayal and Saxena showed that determining the (*) primality of a number is in this class, and another problem in this class is the decision version of finding the greatest common divisor. Cobham's thesis states that this class contains all the problems which are feasibly computable, or "easy" and fast. For 10 points, name this complexity class consisting of all those problems which can be solved in polynomial time on a deterministic Turing machine, which may or may not be equivalent to NP.
Vardi and Immerman showed that this class can be defined as the problems which can be expressed in first-order logic plus a least fixed point operator, in the presence of linear order.
PTIME