Click here to flash read.
arXiv:2404.01728v3 Announce Type: replace
Abstract: We formalize algorithms computing Pfaffian in the theory of bounded arithmetic for sharpL which is based on Berkowitz algorithm for the determinant. We also prove relations among Pfaffian properties. Furthermore, we give an algorithm for Pfaffian pairs as well.
Click here to read this post out
ID: 840621; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: May 7, 2024, 7:33 a.m.
Changes:
Dictionaries:
Words:
Spaces:
Views: 9
CC:
No creative common's license
No creative common's license
Comments: