Abstract
Descriptive complexity theory initiated by celebrated Fagin's theorem aims to characterize complexity classes by the kind of logic necessary to express problems in the class. For many complexity classes such a characterization has been found; this includes the class NP that, according to Fagin's theorem, can be characterized by the monadic second order logic. Some classes, however, eludes such a characterization, and this famously includes the class P. Due to the importance of the class P, finding a logic for P is one of the central open problems in descriptive complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
