Work

Formalizing Pfaffian in bounded arithmetic

Year: 2024

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2404.01728

Author: Kuroda, Satoru

Institution: Gunma Prefectural Women's University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Japan Society for the Promotion of Science

Award: Applications of forcing in bounded arithmetic

OpenAlex ID: W4393967831

Cites:

Cited by:

Related to: 10