3 citations · 6 across the 7 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
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
The Approximate Degree of Bipartite Perfect Matching
Gal Beniamini
The approximate degree of a Boolean function is the least degree of a real multilinear polynomial approximating it in the -norm over the Boolean hypercube. We show tha…
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 …