Mark Bun
2 indexed papers
Recent (6 mo)
2With code
0Influential cites
0Benchmarked
0Publications per year
226
Top categories
Complexity×2Algorithms×1ML×1
Frequent co-authors
Research Timeline
2026
QMA Lower Bounds for Batch Verification via Approximate Degree
The paper studies the resources required to batch verify Boolean functions and provides lower bounds on the witness-query tradeoff based on approximate degree.
Testing Distributions Against Bounded Distinguishers
This paper studies distribution testing with respect to bounded classes of distinguishers, revealing connections between testable learning, verification of learning algorithms, and testing of structured distributions.
Highlighted terms show continued research focus across papers
Papers
cs.DScs.CCcs.LGTheoreticalRecentJul 17, 2026
Testing Distributions Against Bounded Distinguishers
This paper studies distribution testing with respect to bounded classes of distinguishers, revealing connections between testable learning, verification of learning algorithms, and testing of structur…
View →
cs.CCTheoretical