Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus.

Benedikt Pago

Browse the full CSL paper archive.