Formalizing Pfaffian in bounded arithmetic

MaRDI QIDQ6528834arXivFDO

Authors Satoru Kuroda

Published in arXiv

Mathematics Subject Classification ID

Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Determinants, permanents, traces, other special matrix functions (15A15)

This page was built for publication: Formalizing Pfaffian in bounded arithmetic

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