1 citations · 3 across the 4 of their papers we have counts for
1 paper · 1 filter
Matthew Anderson, Anuj Dawar, Bjarki Holm
We establish the expressibility in fixed-point logic with counting (FPC) of a number of natural polynomial-time problems. In particular, we show that the size of a maximum matching…