3 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.DM2022★ 1 cited
Algebraic Representations of Unique Bipartite Perfect Matching
Gal Beniamini
We obtain complete characterizations of the Unique Bipartite Perfect Matching function, and of its Boolean dual, using multilinear polynomials over the reals. Building on previous…
cs.DS2020★ 3 cited
Sparsifying the Operators of Fast Matrix Multiplication Algorithms
Gal Beniamini, Nathan Cheng, Olga Holtz +2
Fast matrix multiplication algorithms may be useful, provided that their running time is good in practice. Particularly, the leading coefficient of their arithmetic complexity need…
cs.DM2020★ 2 cited
Bipartite Perfect Matching as a Real Polynomial
Gal Beniamini, Noam Nisan
We obtain a description of the Bipartite Perfect Matching decision problem as a multilinear polynomial over the Reals. We show that it has full degree and …