scientific article; zbMATH DE number 7204277
From MaRDI portal
Publication:5111156
DOI10.4230/LIPIcs.CCC.2017.26zbMath1440.68327arXiv1704.06314MaRDI QIDQ5111156
Jinyu Xie, Erik Waingarten, Li-Yang Tan, Xi Chen, Rocco A. Servedio
Publication date: 26 May 2020
Full work available at URL: https://arxiv.org/abs/1704.06314
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
Related Items (5)
An adaptivity hierarchy theorem for property testing ⋮ An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model ⋮ Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces ⋮ Unnamed Item ⋮ Almost optimal distribution-free junta testing
This page was built for publication: