Formalizing Pfaffian in bounded arithmetic
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909188969463808 |
|---|---|
| author | Kuroda, Satoru |
| author_facet | Kuroda, Satoru |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_01728 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Formalizing Pfaffian in bounded arithmetic Kuroda, Satoru Logic 03B70, 15A15, 03D15 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. |
| title | Formalizing Pfaffian in bounded arithmetic |
| topic | Logic 03B70, 15A15, 03D15 |
| url | https://arxiv.org/abs/2404.01728 |