K
Kevin Matulef
Researcher at Tsinghua University
Publications - 16
Citations - 765
Kevin Matulef is an academic researcher from Tsinghua University. The author has contributed to research in topics: Property testing & Boolean function. The author has an hindex of 10, co-authored 16 publications receiving 732 citations. Previous affiliations of Kevin Matulef include Aarhus University & Massachusetts Institute of Technology.
Papers
More filters
Journal ArticleDOI
Property Testing Lower Bounds via Communication Complexity
TL;DR: In this article, a technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity, was developed, which is general and implies a number of new testing bounds, as well as simpler proofs of several known bounds.
Proceedings ArticleDOI
Testing k-wise and almost k-wise independence
TL;DR: This work gives evidence that the time complexity of testing (ε,k)-wise independence is likely to be poly(n, 1/ε,1/δ) for k=Θ(log n), since this would disprove a plausible conjecture concerning the hardness offinding hidden cliques in random graphs.
Journal Article
Property Testing Lower Bounds via Communication Complexity.
TL;DR: A new technique for proving lower bounds in property testing is developed, by showing a strong connection between testing and communication complexity, and significantly strengthens the best known bounds.
Proceedings ArticleDOI
Testing halfspaces
TL;DR: In this paper, the authors considered the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w · x - θ).
Journal ArticleDOI
Testing Halfspaces
TL;DR: This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w · x - θ) by giving an algorithm that distinguishes halfspaces from functions that are e-far from any halfspace using only poly(1/e) queries, independent of the dimension n.