Fast computation of permanents over ${\mathbb{F}}_3$ via ${\mathbb{F}}_2$ arithmetic

Danny Scheinerman

We present a method of representing an element of ${\mathbb{F}}_3^n$ as an element of ${\mathbb{F}}_n^2\times {\mathbb{F}}_n^2$ which in practice will be a pair of unsigned integers. We…