Abstract

In the 1980's Eric Lander, Jin-Yi Cai, Martin Fürer and I began to explore the power of fixed point logic with counting (FPC). This natural class is deeply entwined with the challenge of capturing the class of polynomial-time graph properties and determining the complexity of graph isomorphism - problems that remain open. Despite that, so much more is now known about the remarkable power of FPC. Anuj Dawar explains in the following lovely survey.

Full Text
Paper version not known

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 call

Disclaimer: 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.