2 citations · 4 across the 4 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2022★ 1 cited
Hardness of Maximum Likelihood Learning of DPPs
Elena Grigorescu, Brendan Juba, Karl Wimmer +1
Determinantal Point Processes (DPPs) are a widely used probabilistic model for negatively correlated sets. DPPs have been successfully employed in Machine Learning applications to…
cs.CC2017
Flipping out with many flips: hardness of testing k-monotonicity
Elena Grigorescu, Akash Kumar, Karl Wimmer
A function f : {0, 1}^n -> {0, 1} is said to be k-monotone if it flips between 0 and 1 at most k times on every ascending chain. Such functions represent a natural generalization o…
cs.CC2014★ 2 cited
Optimal query complexity for estimating the trace of a matrix
Karl Wimmer, Yi Wu, Peng Zhang
Given an implicit matrix with oracle access for any , we study the query complexity of randomized algorithms for estimating the trace of…