We consider families of symmetric linear programs (LPs) that decide a property graphs (or other relational structures) in the sense that, for each size graph, there is an LP defining polyhedral lift separates integer points corresponding to with from those without property. show this equivalent, at most polynomial blow-up size, Boolean circuits threshold gates. In particular, when we polynomial...
