Bisimulation-invariant PTIME and higher-dimensional &mgr;-calculus
Theoretical Computer Science
Fixed-Point Logics on Planar Graphs
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
A Logic for PTIME and a Parameterized Halting Problem
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Choiceless Polynomial Time, Counting and the Cai--Fürer--Immerman Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
ICDT'05 Proceedings of the 10th international conference on Database Theory
On p-optimal proof systems and logics for PTIME
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Locality of queries definable in invariant first-order logic with arbitrary built-in predicates
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem
Journal of the ACM (JACM)
Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
Discrete Applied Mathematics
| Hi-index | 0.00 |
My talk will be a survey of recent results about the quest for a logic capturing polynomial time.