The Quest for a Logic Capturing PTIME

The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the early, mostly negative results that were obtained until the mid 1990s, and then move on to positive results about capturing polynomial time on specific classes of graphs. This will include recent results on definability in fixed-point logic and graph structure theory. Finally, I will dicuss stronger logics and propose directions for further research. The purpose of this accompanying note is to give the basic definitions in detail, state the main results, mention some open problems, and give a list of references.

• Type: Conference
• Year: 2008
• Where: LICS
• Authors: Martin Grohe
• Keywords: Computer Science, Descriptive Complexity Theory, LICS 2008, Open Problems, Polynomial Time