記述計算量
1. Descriptive complexity theoryDescriptive 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 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.
Read “Descriptive complexity theory” on English Wikipedia
Read “記述計算量” on Japanese Wikipedia
Read “Descriptive complexity theory” on DBpedia
Read “Descriptive complexity theory” on English Wikipedia
Read “記述計算量” on Japanese Wikipedia
Read “Descriptive complexity theory” on DBpedia
Discussions
Log in to talk about this word.