Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02474251n
Noun Concept
SYL
No term available
EN
Fagin's theorem is the oldest result of descriptive complexity theory, a branch of computational complexity theory that characterizes complexity classes in terms of logic-based descriptions of their problems rather than by the behavior of algorithms for solving those problems. Wikipedia
Relations
Sources
IS A
EN
theorem
PART OF
EN
descriptive complexity theory
NAMED AFTER
Ronald Fagin

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