Andere Kunden interessierten sich auch für
![Descriptive Complexity]( "Descriptive Complexity")
Descriptive Complexity137,99 €![Descriptive Set Theoretic Methods in Automata Theory]( "Descriptive Set Theoretic Methods in Automata Theory")
Descriptive Set Theoretic Methods in Automata Theory37,99 €![Descriptive tools for electronic processing of dictionary data]( "Descriptive tools for electronic processing of dictionary data")
Descriptive tools for electronic processing of dictionary data109,95 €![A Descriptive Study of Bengali Words]( "A Descriptive Study of Bengali Words")
A Descriptive Study of Bengali Words92,99 €![Supervised Descriptive Pattern Mining]( "Supervised Descriptive Pattern Mining")
Supervised Descriptive Pattern Mining81,99 €![Supervised Descriptive Pattern Mining]( "Supervised Descriptive Pattern Mining")
Supervised Descriptive Pattern Mining74,99 €![Complexity Class]( "Complexity Class")
Complexity Class22,99 €
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 all complexity classes in the polynomial hierarchy, is precisely the class of languages expressible by statements of second-order logic. This connection between complexity and logic allows results to be transferred easily from one area to the other, facilitating new proof methods and providing additional evidence that the main complexity classes are somehow "natural" and not tied to the specific abstract machines used to define them.