Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02474251n
Noun Concept
Categories: Descriptive complexity, Theorems in computational complexity theory
EN
Fagin's theorem  Fagin theorem
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
Definitions
Relations
Sources
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
IS A
theorem
PART OF
descriptive complexity theory
NAMED AFTER
Ronald Fagin
Wikipedia
EN
Fagin's theorem
Wikidata
EN
Fagin's theorem
Wikipedia Redirections
EN
Fagin theorem

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