2000 character limit reached
Formalizing Pfaffian in bounded arithmetic (2404.01728v3)
Published 2 Apr 2024 in math.LO
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.
- S.J.Berkowitz, On computing the determinant in small parallel time using a small number of processors. Information Processing Letters. 18 (3): pp.147–150 (1984)
- M. Mahajan, P. R. Subramanya and V. Vinay, “The Combinatorial Approach Yields an NC Algorithm for Computing Pfaffians”, Discrete Appl. Math., 143:1–3 (2004) 1–16.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.