Proof complexity of universal algebra in a CSP dichotomy proof

MaRDI QIDQ6525524arXivFDO

Authors Azza M. Gaysin

Published in arXiv

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03) Algorithms in computer science (68W99)

This page was built for publication: Proof complexity of universal algebra in a CSP dichotomy proof

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6525524)