There is a constant k such that the resource is bound by O(log**k n), where n is the size of the input. Deterministic TM Stochastyc TM Languages recognizable by polynomially time bounded deterministic TMs. Identiifes the informal definition of "efficiently solvable" Symmetric TM The resource is bound by O(n!), where n is the size of the input. The Gill-Miller finite difference method. Class of decision problems that are complements of NP problems. Commonly used bounds on space and time resources. Random Access Machine Parallel Random Access Machine Quadrature rules using non-uniformly spaced abscissae. Probabilistic TM High-order extensions to Kronrod Rule. Counting TM Oracle TM Unambiguous TM Models of Computations Used in Theoretical Complexity Theory The resource is bound by O(n), where n is the size of the input. Nondeterministic TM Quadrature rules using uniformly spaced abscissae. The resource is bound by O(log n), where n is the size of the input. Languages recognizable by NDTMs in polynomial time. Quadrature rules using fixed number of abscissae. There is a constant k such that the resource is bound by O(n**k), where n is the size of the input. Alternating Turing Machine Parity TM No constant is imposed on the resource Random TM Zbl_0277.65028 There exists a constant k such that the resource is bound by k for all sizes n of the input. Zbl_0315.65031 Boolean Circuit Family There is a constant k such that the resource is bound by O(2**n**k), where n is the size of the input. The resource is bound by O(n*log n), where n is the size of the input.