Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00353597n
Noun Concept
Categories: Finite model theory, Computational complexity theory, Descriptive complexity
EN
descriptive complexity theory  FO  descriptional complexity  descriptive complexity  HO
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia
HAS PART
Fagin's theorem
PART OF
model theory
Wikipedia
EN
descriptive complexity theory
Wikidata
EN
descriptive complexity theory
Wikipedia Redirections
EN
descriptional complexity, descriptive complexity, FO(PFP), HO (complexity), Immerman-Vardi, Immerman-Vardi theorem, SO (complexity)

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License