Descriptive complexity is a branch of computational complexity theory that connects complexity classes to the type of logic needed to express them. Ronald Fagin's 1974 theorem established that NP is precisely the set of languages expressible by sentences of existential second-order logic. This connection between complexity and logic allows for results to be transferred easily from one area to the other.
Carnegie Mellon University
Spring 2023
This course provides an initial dive into complexity theory, exploring computations bound by resources like time, space, and energy. Emphasis is placed on low complexity classes.
No concepts data
+ 29 more concepts