1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.CC2019
Approximate degree, secret sharing, and concentration phenomena
Andrej Bogdanov, Nikhil S. Mande, Justin Thaler +1
The -approximate degree of a Boolean function is the least degree of a real-valued polynomial that approximates pointwise to error . The approximate degree…
math.CO2015★ 1 cited
Bounds on Geometric Eigenvalues of Graphs
Mary Radcliffe, Chris Williamson
The smallest nonzero eigenvalue of the normalized Laplacian matrix of a graph has been extensively studied and shown to have many connections to properties of the graph. We here st…