Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > GAL GROSS:
All reports by Author Gal Gross:

TR25-206 | 6th December 2025
Fatemeh Ghasemi, Gal Gross, Swastik Kopparty

Permanental rank versus determinantal rank of random matrices over finite fields

This paper is motivated by basic complexity and probability questions about permanents of random matrices over small finite fields, and in particular, about properties separating the permanent and the determinant.

Fix $q = p^m$ some power of an odd prime, and let $k \leq n$ both be growing. For ... more >>>




ISSN 1433-8092 | Imprint