3 citations · 6 across the 7 of their papers we have counts for
Showing 2020 · cs.DMShow all
2 papers · 2 filters
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 …