first+order+complexity

См. также в других словарях:

• First-order reduction — A first order reduction is a very weak type of reduction between two computational problems in computational complexity theory. A first order reduction is a reduction where each component is restricted to be in the class FO of problems calculable …   Wikipedia

• Order — Contents 1 Ordinality 2 Philosophy 3 Science 4 Mathe …   Wikipedia

• Order — n. & v. n. 1 a the condition in which every part, unit, etc. is in its right place; tidiness (restored some semblance of order). b a usu. specified sequence, succession, etc. (alphabetical order; the order of events). 2 (in sing. or pl.) an… …   Useful english dictionary

• order — n. & v. n. 1 a the condition in which every part, unit, etc. is in its right place; tidiness (restored some semblance of order). b a usu. specified sequence, succession, etc. (alphabetical order; the order of events). 2 (in sing. or pl.) an… …   Useful english dictionary

• Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… …   Wikipedia

• complexity — /keuhm plek si tee/, n., pl. complexities for 2. 1. the state or quality of being complex; intricacy: the complexity of urban life. 2. something complex: the complexities of foreign policy. [1715 25; COMPLEX + ITY] * * * ▪ scientific theory… …   Universalium

• Order dimension — A partial order of dimension 4 (shown as a Hasse diagram) and four total orderings that form a realizer for this partial order. In mathematics, the dimension of a partially ordered set (poset) is the smallest number of total orders the… …   Wikipedia

• Complexity economics — Economics …   Wikipedia

• Descriptive complexity theory — For other uses, see Kolmogorov complexity. Descriptive complexity is a branch of computational complexity theory and of finite model theory that characterizes complexity classes by the type of logic needed to express the languages in them. For… …   Wikipedia

• Second-order logic — In logic and mathematics second order logic is an extension of first order logic, which itself is an extension of propositional logic.[1] Second order logic is in turn extended by higher order logic and type theory. First order logic uses only… …   Wikipedia

• Descriptive complexity — is a branch of finite model theory, a subfield of computational complexity theory and mathematical logic, which seeks to characterize complexity classes by the type of logic needed to express the languages in them. For example, PH, the union of… …   Wikipedia